Conditional rate modelling

ABSTRACT

A system for generating a model of unknown values of several rate series at specified times includes a computing device configured to receive input indicative of the parametric model type of the unconditional rate dynamics; receive input indicative of a known or unknown rate value for each rate series and for each specified time into the computing device; generate the values of the known rate changes; generate an unconditional multidimensional probability distribution of the known and unknown rate changes; generate a multidimensional probability distribution of the unknown rate changes conditional on the known rate changes taking their known values; and provide output from the computing device indicative of the modelled values of the unknown values of the several rate series. The several rate series have unconditional rate dynamics characterised by a parametric model type in several dimensions, each rate series having at least one known value.

FIELD OF THE INVENTION

The invention relates to conditional rate modelling of market rates and, in particular, to modelling unknown values of several rate series at specified times.

The invention has been developed primarily for use in modelling the zero coupon rate curves of several bond issuers given limited trading data and will be described hereinafter with reference to this application. However, it will be appreciated that the invention is not limited to this particular field of use.

BACKGROUND OF THE INVENTION

Institutions that are active in financial markets routinely apply mathematically based models to value financial instruments in their trading portfolios. A valuation model typically takes as input the current values of a number of market rates and gives as output a theoretical price, or fair value, of the instrument in question. This allows the valuation of a financial instrument that may not have been traded recently, provided that the input market rates are available.

These input market rates are typically the traded prices of simpler financial instruments of which an example is a foreign exchange rate. Market rates are only known if the trade took place in the relevant instrument during the time interval of interest. If a trade did not take place, one could use the rate corresponding to the last trade that took place, but that will cause inaccuracy because of the lack of currency of the rate.

A basic use of valuation models is to determine the daily profit and loss of trading portfolios. This involves comparing the value of a trading portfolio at the end of one day with its value at the end of the previous trading day, and requires the valuation of financial instruments that may not have traded in the course of the trading day. Valuation models are also used to inform trading decisions and to assess the risks arising out of trading portfolios. Market risk is the risk of the value of a trading portfolio decreasing. Credit risk is the risk of a counter-party of a trade defaulting on contractual obligations. The amount of loss attributable to a default depends, at least in part, on the market value of the trades of the defaulting counter-party at the time of default.

The analysis of market risk involves making probabilistic assumptions as to how market rates may change in the future. The impact of possible market rate changes on the value of the trading portfolio is then quantified and various measures of risk can be calculated.

A common method of market risk assessment is historical simulation. Historically observed rate changes of several rate series together are assumed to be statistically independent and to form a representative random sample and are applied to current rates. The resulting sets of rates (one for each historical time interval) are then used to revalue an existing trading portfolio. This gives a set of a hypothetical future portfolio values used to calculate measures of market risk arising out of the trading portfolio. However, this method disadvantageously requires gaps in the historical rate series to have been filled before the analysis begins. It also assumes that a complete set of current rates exists.

One known approach is to set each unknown rate to its previous known value. This can cause long sequences of repeated values, which leads to underestimation of risk, and sudden large jumps to the next known value, which leads to overestimation of risk.

Another approach is to fill gaps in each rate series by linearly interpolating between the known rates. This involves graphing, for each rate series, the known values, drawing straight lines between consecutive known values and reading off the unknown rates from the resulting graph. This approach tends to cause underestimation of risk because it ignores the inherent variation in rates and does not take into account the fact that the rate series are correlated.

A significant disadvantage of prior art methods of modelling unknown rates is that they do not take into account all known rates, including those of other rate series and those known at other times, that are related to the unknown rates. The effect this is inaccuracy in any pricing or analysis of risk that depends on such rates.

OBJECT OF THE INVENTION

It is an object of the present invention to provide a method of modelling unknown values of several rate series at specified times that overcomes or substantially ameliorates one or more of the disadvantages of the prior art, or to provide a useful alternative.

SUMMARY OF THE INVENTION

According to a first aspect of the invention there is provided a computer-implemented method of modelling unknown values of several rate series at specified times, the several rate series having unconditional rate dynamics characterised by a parametric model type in several dimensions and each rate series having at least one known value, the method comprising the steps of:

specifying the parametric model type of the unconditional rate dynamics;

specifying a known or unknown rate value for each rate series and for each specified time;

calculating the values of the known rate changes;

calculating an unconditional multidimensional probability distribution of the known and unknown rate changes; and

computing a multidimensional probability distribution of the unknown rate changes conditional on the known rate changes taking their known values.

According to a second aspect of the invention there is provided a computer-implemented method of modelling the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the issuers, the specified zero coupon rate series having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising the steps of:

specifying the unconditional dynamics of the specified zero coupon rate series;

specifying the trades in the bonds of the one or more issuers; and

calculating iteratively the dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers.

According to a third aspect of the invention there is provided a computer-implemented method of modelling the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the one or more issuers, the number of specified zero coupon rate series of each issuer being equal and the specified zero coupon rate series determining zero coupon rate spread series having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising the steps of:

specifying the unconditional dynamics of the determined zero coupon rate spread series;

specifying the trades in the bonds of the one or more issuers; and

calculating iteratively the dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers.

According to a fourth aspect of the invention there is provided a computer-implemented method of detecting the known values, of several rate series at specified times, that are extreme, the method comprising the steps of:

assigning a known or unknown rate value for each rate series and for each specified time;

specifying a subset of the known rates comprising those that are to be accepted without question;

specifying a confidence level and constructing, for each known rate that is not to be accepted without question and for each subset of the known rates that does not include the given known rate and that includes the known rates that are to be accepted without question, a confidence interval, based on the given confidence level, for the given rate conditional on the rates belonging to the given subset taking their known values; and

iteratively constructing a subset of the known rates that are not to be accepted without question such that, for each rate belonging to the subset, the value of the rate does not lie within the confidence interval, based on the given confidence level, constructed for the rate conditional on the known rates which do not belong to the subset taking their known values, and for each known rate that does not belong to the subset and that is not to be accepted without question, the value of the rate lies within the confidence interval, based on the given confidence level, constructed for the rate conditional on the known rates, with the exception of the given known rate, which do not belong to the subset taking their known values.

According to another aspect of the invention there is provided a computer-implemented method of modelling the dynamics of specified maturity-parameterised rate series at specified times conditional on specified observed values of the rate series, each rate series being assigned specified maturities and the rate series with their specified maturities having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising the steps of:

specifying the unconditional dynamics of the specified rate series with their specified maturities;

specifying the observed values of the specified rate series; and

calculating iteratively the dynamics of the specified rate series at the specified times conditional on the specified observed values of the rate series.

It can be seen that there is provided a method of modelling unknown values of several rate series at specified times which provides more accurate results than can be obtained by using prior art methods.

BRIEF DESCRIPTION OF THE DRAWINGS

Preferred embodiments of the present invention will now be described, by way of example only, with reference to the accompanying drawings in which:

FIG. 1 is a block diagram of a modelling system according to a preferred embodiment; and

FIG. 2 is a process flow diagram for modelling unknown values according to a preferred embodiment.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to FIG. 1, the modelling system 1 is software installed on a computer 2 and comprises a modelling engine 10 which processes two sets of input data taken from two input files 20 and 21. The first file contains the unconditional rate dynamics 20 for the several rate series and the second file contains the incomplete rate data 21 for the several rate series.

The unconditional rate dynamics is stored in tabular form. There is a first table where each column corresponds to a rate series and where there are three rows, the first corresponds to the parametric model type of the rate series (Brownian Motion or Geometric Brownian motion), the second row corresponds to the standard deviation of the rate changes per unit interval of time for the rate series, and the third row corresponding to the mean of the rate changes per unit interval of time for the rate series. Each cell of the table contains a specification of the relevant parameter. There is a second table where both of the rows and the columns correspond to rate series and each cell in the table contains the value of the correlation coefficient of the rate changes for the pair of rate series determined by the rows and the column of the cell.

The incomplete rate data is also stored in tabular form. There is a table where each column corresponds to a rate series, each row corresponds to a specified point in time and each cell in the table contains a rate value for the rate series determined by the column of the cell at the point in time determined by the row of the cell. The rows are ordered in ascending order of the associated points in time. Rate values are either known or unknown.

Each unknown rate value is indicated by an asterisk “*” and each known rate value is indicated by the known numerical value. On selection, the modelling engine can generate any one of four sets of outputs for storage into an output files. The first set of outputs comprises the marginal distributions 30 of the unknown rate values or of the unknown rate changes over time intervals determined by successive points in time. The remaining three sets of outputs 31, 32 and 33 each comprise filled values for the unknown values so as to complete the incomplete rate data 21. The second set of outputs fills the unknown values using expected rate changes 31. The third set of outputs fills the unknown values using expected values 32. The fourth set of outputs fills the unknown values using simulated values 33. The simulated values 33 can be generated any number of times with freshly simulated values for each simulation. For each simulation, the unknown values are all simulated together.

Referring to FIG. 2, the unconditional rate dynamics is specified 50 into the unconditional rate dynamics input file 20. This involves specifying, for each rate series, the parametric model, the standard deviation and the mean of the rate changes per unit interval of time, and specifying, for each pair of rate series, the correlation coefficient of the rate changes.

Conditional Rate Modelling: (Geometric) Brownian Motion

A stochastic process B=(B_(t))_(tεR) is a one-dimensional Brownian Motion (BM) if there exist μεR and σ≧0 such that:

-   -   (1) B_(t) ₂ −B_(t) ₁ is a normally distributed random variable         for t₁≦t₂,     -   (2) E(B_(t) ₂ −B_(t) ₁ )=(t₂−t₁)μ for t₁≦t₂,     -   (3) var(B_(t) ₂ −B_(t) ₁ (t₂−t₁)σ² for t₁≦t₂, and     -   (4) B_(t) ₂ −B_(t) ₁ and B_(t) ₂ _(′)−B_(t) ₁ _(′) are         independent whenever m([t₁,t₂]∩[t₁′,t₂′])=0, for t₁≦t₂ and         t₁′≦t₂′, where m is Lebesgue measure on R.

Note that (1)-(3) imply that B_(t+1)−B_(t)˜N(μ,σ²) for any tεR.

A stochastic process B=(B_(t))_(tεR) is a one-dimensional Geometric Brownian Motion (GBM) if (ln(B_(t)))_(tεR) is a one-dimensional Brownian Motion.

We start with m rate series R⁽¹⁾, . . . , R^((m)) where m≧1.

Each R^((j))=(R_(t) ^((j)))_(tεR) is a stochastic process, where R_(t) ^((j)) is the value of the j^(th) rate series at time t. We assume that time here is the time underlying the assumed rate dynamics, and this may be different from calendar time. For example, time could be measured in trading days or calendar days.

Now each R^((j)) is going to be either a BM or a GBM.

Put $X_{t}^{(j)}\overset{df}{=}\left\{ {{\begin{matrix} R_{t}^{(j)} & {{if}\quad R^{(j)}{is}\quad{to}\quad{be}\quad a\quad{BM}} \\ {\ln\left( R_{t}^{(j)} \right)} & {{{if}\quad R^{(j)}{is}\quad{to}\quad{be}\quad a\quad{GBM}},} \end{matrix}\quad{for}\quad j} \in \left\{ {1,\ldots\quad,m} \right\}} \right.$ and tεR.

For tεR, put $X_{t}\overset{df}{=}{\begin{pmatrix} X_{t}^{(1)} \\ \vdots \\ X_{t}^{(m)} \end{pmatrix}.}$

Then $X\overset{df}{=}\left( X_{t} \right)_{t \in R}$ is a vector-valued stochastic process.

We also have the stochastic process $X^{(j)}\overset{df}{=}\left( X_{t}^{(j)} \right)_{t \in R}$ for each jε{1, . . . , m}.

Now each X^((j)) is going to be a BM. But we make the stronger assumption that X is an m-dimensional Brownian Motion: that is, we assume that there exists μ=(μ_(j))εR^(m) and a matrix κ=(κ_(j,j′))_((j,j′)), where 1≦j,j′≦m, such that:

-   -   (1) X_(t) ₂ −X_(t) ₁ is a normally distributed random variable         for t₁≦t₂,     -   (2) E(X_(t) ₂ −X_(t) ₁ )=(t₂−t₁)μ for t₁≦t₂,     -   (3) cov(X_(t) ₂ −X_(t) ₁ ,X_(t) ₂ −X_(t) ₁ )=(t₂−t₁)κ for t₁≦t₂,         and     -   (4) X_(t) ₂ −X_(t) ₁ and X_(t) ₂ _(′)−X_(t) ₁ _(′) are         independent whenever m([t₁,t₂]∩[t₁′,t₂′])=0, for t₁≦t₂ and         t₁′≦t₂′.

Note that (1)-(4) imply that each X^((j)) is a one-dimensional BM.

In particular, if we put $\sigma_{j}\overset{df}{=}\sqrt{\kappa_{j,j}}$ for jε{1, . . . , m}, we have:

(1) X_(t) ₂ ^((j))−X_(t) ₁ ^((j)) is a normally distributed random variable for t₁≦t₂,

(2) E(X_(t) ₂ ^((j))−X_(t) ₁ ^((j))=(t₂−t₁)μ_(j) for t₁≦t₂,

(3) cov(X_(t) ₂ ^((j))−X_(t) ₁ ^((j)),X_(t) ₂ ^((j))−X_(t) ₁ ^((j)))σ_(j) ² for t₁≦t₂, and

(4) X_(t) ₂ ^((j))−X_(t) ₁ ^((j)) and X_(t) ₂ _(′) ^((j))−X_(t) ₁ _(′) ^((j)) are independent whenever m([t₁,t₂]∩[t₁′,t₂′])=0,

for t₁≦t₂ and t₁′≦t₂′. $\mu = \begin{pmatrix} \mu_{1} \\ \vdots \\ \mu_{m} \end{pmatrix}$ is the mean vector of rate changes per unit interval of time and κ=(κ_(j,j′))_((j,j′)) is the covariance matrix of rate changes per unit interval of time.

The covariance matrix can be determined by giving a volatility vector $\sigma = \begin{pmatrix} \sigma_{1} \\ \vdots \\ \sigma_{m} \end{pmatrix}$ per unit interval of time and a correlation matrix ρ=(ρ_(j,j′))_((j,j′)), where $\sigma_{j}\overset{df}{=}\sqrt{\kappa_{j,j}}$ and $\rho_{j,j^{\prime}}\overset{df}{=}{\frac{\kappa_{j,j^{\prime}}}{\sigma_{j}\sigma_{j^{\prime}}}.}$ . Then κ_(j,j′)=ρ_(j,j′)σ_(j) σ_(j′) for j,j′ε{1, . . . , m}.

Note that if either of σ_(j) or σ_(j′) is zero, then ρ_(j,j′) is undefined, but κ_(j,j′)=0, so that any value for ρ_(j,j′) (say, 0 or 1) will yield the correct value for κ_(j,j′).

Note that the term volatility is used to denote the standard deviation of rate changes.

Note also that if R^((j)) is a GBM, we have X_(t) ₂ ^((j))−X_(t) ₁ ^((j))=ln(R_(t) ₂ ^((j)))−ln(R_(t) ₁ ^((j)))=ln(R_(t) ₂ ^((j))/R_(t) ₁ ^((j))). For R^((j)) a GBM, we assume that R_(t) ^((j))<0 for all tεR, because ln(x) is not defined for x≦0.

For jε{1, . . . , m}, let us define $\Delta_{t_{1},t_{2}}^{(j)}\overset{df}{=}{X_{t_{2}}^{(j)} - X_{t_{1}}^{(j)}}$ for t₁≦t₂.

We then define $\Delta_{t_{1},t_{2}}\overset{df}{=}\begin{pmatrix} \Delta_{t_{1},t_{2}}^{(1)} \\ \vdots \\ \Delta_{t_{1},t_{2}}^{(m)} \end{pmatrix}$ for t₁≦t₂.

The assumption of an m-dimensional Brownian Motion then reduces to:

-   -   (1) Δ_(t) ₁ _(,t) ₂ ˜N((t₂−t₁)μ,(t₂−t₁)κ) for t₁≦t₂, and     -   (2) Δ_(t) ₁ _(,t) ₂ and Δ_(t) ₁ _(′,t) ₂ _(′) are independent         whenever m([t₁,t₂]∩[t₁′,t₂′])=0, for t₁≦t₂ and t₁′≦t₂′.

This constitutes our assumed unconditional rate dynamics.

Referring to FIG. 2, the incomplete rate data is specified 51 in the incomplete series of rates input file 20.

We now restrict our attention to n+1 times t₀, t₁, . . . , t_(n) satisfying t₀<t₁< . . . <t_(n), where n≧1. We then have the n time intervals [t₀, t₁], . . . , [t_(n−1), t_(n)]. We suppose that the values of some of the rates R_(t) _(i) ^((j)), where jε{1, . . . , m} and iε{0, 1, . . . , n}, are known and the others are unknown. We wish to determine what the known rates imply about the unknown rates, given the assumed unconditional rate dynamics. In particular, we wish to:

(1) determine the probability distribution of the unknown rates,

(2) estimate the unknown rates, and

(3) simulate the unknown rates.

First observe that Δ_(t) _(i) _(,t) _(i′) ^((j)), is known if and only if R_(t) _(i) ^((j)) and R_(t) _(i′) ^((j)) are both known, for i<i′.

Let us define $\Delta_{i}^{(j)}\overset{df}{=}\Delta_{t_{i - 1},t_{i}}^{(j)}$ for jε{1, . . . , m} and iε{1, . . . , n}, and ${\Delta\quad t_{i}}\overset{df}{=}{t_{i} - t_{i - 1}}$ for iε{1, . . . , n}.

Then the Brownian Motion assumption implies that E(Δ_(i) ^((j)))=Δt_(i)μ_(j) and cov(Δ_(i) ^((j)),Δ_(i′) ^((j′)))=δ_(i,i′)Δt_(i)κ_(j,j′), where $\delta_{i,i^{\prime}}\overset{df}{=}\left\{ \begin{matrix} 1 & {{{if}\quad i} = i^{\prime}} \\ 0 & {{{if}\quad i} \neq i^{\prime}} \end{matrix} \right.$ is the Kronecker delta function. The Brownian Motion assumption also implies that $\Delta\overset{df}{=}\left( \Delta_{i}^{(j)} \right)_{{1 \leq j \leq m},{1 \leq i \leq n}}$ is multivariate normal in R^(mn).

Referring to FIG. 2, the runs and the unknown rate changes are determined 52.

Let us call a known rate change of the form Δ_(t) _(i) _(,t) _(i′) ^((j)) run if:

(1) 1≦j≦m,

(2)0≦i<i′≦n, and

(3) R_(t) _(k) ^((j)) is unknown for all k satisfying i<k<i′,

and let the length of the run be i′−i.

Every run is of length ≧1.

If Δ_(t) _(i) _(,t) _(i′) ^((j)) is a run of length 1, we have Δ_(t) _(i) _(,t) _(i′) ^((j))=Δ_(i′) ^((j)) and R_(t) _(i′−1) ^((j)) and R_(t) _(i′) ^((j)) are both known, and, for any run Δ_(t) _(i) _(,t) _(i′) ^((j)), both R_(t) _(i) ^((j)) and R_(t) _(i′) ^((j)) are known.

Suppose that there are M runs. Let ξ be a random vector in R^(M) whose components consist of the runs. Then there is a vector xεR^(M) such that the condition ξ=x expresses the fact that the known rate changes take their known values. Now suppose that there are N unknowns of the form Δ_(i) ^((j)) where 1≦j≦m and 1≦i≦n. Let θ be a random vector in R^(N) whose components consist of these unknown rate changes.

For any run Δ_(t) _(i) _(,t) _(i′) ^((j)), we have ${\Delta_{t_{i},t_{i^{\prime}}}^{(j)} = {\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad\Delta_{k}^{(j)}}},$ so that all the components of ξ and θ are of the form $\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad{\Delta_{k}^{(j)}.}$ . Now $\begin{matrix} {{E\left( {\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad\Delta_{k}^{(j)}} \right)} = {\sum\limits_{k = {i + 1}}^{i^{\prime}}{E\left( \quad\Delta_{k}^{(j)} \right)}}} \\ {= {\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad{\Delta\quad t_{k}\mu_{j}}}} \end{matrix}$ and $\begin{matrix} {{{{cov}\left( {{\sum\limits_{k = {i_{1\quad} + 1}}^{i_{1}^{\prime}}\quad\Delta_{k}^{(j)}},{\sum\limits_{k^{\prime} = {i_{2\quad} + 1}}^{i_{2}^{\prime}}\quad\Delta_{k^{\prime}}^{(j^{\prime})}}} \right)} = \sum\limits_{k = {i_{1\quad} + 1}}^{i_{1}^{\prime}}},{\sum\limits_{k^{\prime} = {i_{2\quad} + 1}}^{i_{2}^{\prime}}{{cov}\left( {\Delta_{k}^{(j)},\quad\Delta_{k^{\prime}}^{(j^{\prime})}} \right)}}} \\ {{= \sum\limits_{k = {i_{1\quad} + 1}}^{i_{1}^{\prime}}},{\sum\limits_{k^{\prime} = {i_{2\quad} + 1}}^{i_{2}^{\prime}}{\delta_{k,k^{\prime}}\Delta\quad t_{k}{\kappa_{j,j^{\prime}}.}}}} \end{matrix}$

Thus we can calculate ${E\begin{pmatrix} \xi \\ \theta \end{pmatrix}}\quad{and}\quad{{{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}.}$

We also have $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ multivariate normal in R^(M+N).

Consider a run ξ_(α) of length ≧2, for some αε{1, . . . , M}.

Then $\xi_{\alpha} = {\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad\Delta_{k}^{(j)}}$ for some j and i′>i+1, where Δ_(i+1) ^((j)), . . . , Δ_(i′) ^((j)) are all unknown. So there exist α_(k)ε{1, . . . , N}, for k=i+1, . . . , i′, satisfying $\xi_{\alpha} = {\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad{\theta_{\alpha_{k}}.}}$ .

The algebraic dependence is preserved almost everywhere (a.e. or with probability one) if we replace ξ by any random ξ′ such that ${E\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix}} = {{{E\begin{pmatrix} \xi \\ \theta \end{pmatrix}}\quad{and}\quad{{cov}\left( {\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix},\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix}} \right)}} = {{{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad,\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}.}}$ This follows from the proof of the following result:

Let $\xi = {{\begin{pmatrix} \xi_{1} \\ \vdots \\ \xi_{M} \end{pmatrix}\quad{and}\quad\theta} = \begin{pmatrix} \theta_{1} \\ \vdots \\ \theta_{N} \end{pmatrix}}$ be random vectors. Suppose that each ξ_(i) is an affine function of θ₁, . . . , θ_(N). Then for any ξ′ such that ${{E\left( \xi^{\prime} \right)} = {{{E(\xi)}\quad{and}\quad{{cov}\left( {\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix},\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix}} \right)}} = {{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad,\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}}},$ we have ξ′=ξ a.e. Proof

Put ${\eta\overset{df}{=}{{\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad{and}\quad\eta^{\prime}}\overset{df}{=}\begin{pmatrix} \xi^{\prime} \\ \theta \end{pmatrix}}},$ and suppose that E(η′)=E(η) and cov(η′, η′)=cov(η, η).

Let iε{1, . . . , M}. It is enough to show that ξ_(i)′=ξ_(i) a.e.

We have σ_(ξ) _(i) _(′)=σ_(ξ) _(i) because cov(η, η)=cov(η′, η′).

First suppose that σ_(ξ) _(i) _(′)=0. Then ξ_(i)′=E(ξ_(i)′) a.e. and ξ_(i)=E(ξ_(i)) a.e.

But E(ξ_(i))=E(ξ_(i)′), because E(η)=E(η′). Thus ξ_(i)=ξ_(i)′ a.e.

Now suppose that σ_(ξ) _(i) _(′)>0.

But $\xi_{i} = {\lambda_{i} + {\sum\limits_{j = 1}^{N}\quad{\lambda_{i,j}\theta_{j}}}}$ for some real numbers λ_(i), λ_(1,j), . . . , λ_(N,j).

Then $\begin{matrix} {{{cov}\left( {\xi_{i}^{\prime},\xi_{i}} \right)} = {{cov}\left( {\xi_{i}^{\prime},{\lambda_{i} + {\sum\limits_{j = 1}^{N}{\lambda_{i,j}\theta_{j}}}}} \right)}} \\ {= {{cov}\left( {\xi_{i}^{\prime},{\sum\limits_{j = 1}^{N}{\lambda_{i,j}\theta_{j}}}} \right)}} \\ {= {\sum\limits_{j = 1}^{N}{\lambda_{i,j}{{cov}\left( {\xi_{i}^{\prime},\theta_{j}} \right)}}}} \\ {= {\sum\limits_{j = 1}^{N}{\lambda_{i,j}{{cov}\left( {\xi_{i}^{\prime},\theta_{j}} \right)}}}} \end{matrix}$ (because cov(η, η)=cov(η′, η′)) ${= {{{cov}\left( {\xi_{i},{\lambda_{i} + {\sum\limits_{j = 1}^{N}\quad{\lambda_{i,j}\theta_{j}}}}} \right)} = \sigma_{\xi_{i}}^{2}}},$ so that ${{\rho\left( {\xi_{i}^{\prime},\xi_{i}} \right)} = {\frac{{cov}\left( {\xi_{i}^{\prime},\xi_{i}} \right)}{\sigma_{\xi}^{\prime}\sigma_{\xi_{i}}} = {\frac{\sigma_{\xi_{i}}^{2}}{\sigma_{\xi_{i}}^{2}} = 1}}},{whence}$ $\frac{\xi_{i}^{\prime} - {E\left( \xi_{i}^{\prime} \right)}}{\sigma_{\xi_{i}^{\prime}}} = {{\frac{\xi_{i} - {E\left( \xi_{i} \right)}}{\sigma_{\xi_{i}}}{a.e}}..}$

But E(ξ_(i)′)=E(ξ_(i)) and σ_(ξ) _(i) _(′)=σ_(ξ) _(i) . Thus we have ξ_(i)′=ξ_(i) a.e.

Referring to FIG. 2, cov(ξ,ξ) is decomposed 53.

We now wish to determine the distribution of θ conditional on ξ=x.

Now cov(ξ,ξ) is an M by M symmetric real matrix. So there is an orthonormal basis {b₁, . . . , b_(M)} of R^(M) consisting of eigenvectors of cov(ξ,ξ). Put $B\overset{df}{=}{\left( {b_{1}{\ldots }b_{M}} \right).}$ Then B is orthogonal and ${{B^{T}{cov}\quad\left( {\xi,\xi} \right)B} = \begin{pmatrix} \lambda_{1} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \lambda_{M} \end{pmatrix}},$ where λ_(j) is the eigenvalue of cov(ξ,ξ) corresponding to the eigenvector b_(j), for jε{1, . . . , M}. Note that λ_(j)≧0 for each j, because cov(ξ, ξ) is non-negative definite.

Without loss of generality, there is a unique rε{0, 1, . . . , M} such that λ₁≧ . . . ≧λ_(r)>λ_(r+1)=λ_(M)=0 (reordering the columns of B and renaming the eigenvalues, if necessary).

Put ${D\overset{df}{=}\left( {\frac{\begin{matrix} \frac{1}{\sqrt{\lambda_{1}}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \frac{1}{\sqrt{\lambda_{r}}} \end{matrix}}{0}❘\frac{\begin{matrix} \quad \\ 0 \\ \quad \\ \quad \end{matrix}}{0}} \right)},$ an M by M matrix.

We also put $Z\overset{df}{=}{{{DB}^{T}\left( {\xi - {E(\xi)}} \right)}.}$

Say $Z = \begin{pmatrix} Z_{1} \\ \vdots \\ Z_{M} \end{pmatrix}$ and B=(b_(ij))_((i,j)).

Then E(Z)=0 and ${Z = \begin{pmatrix} {\frac{1}{\sqrt{\lambda_{1}}}{\sum\limits_{j = 1}^{M}\quad{b_{j1}\left( {\xi_{j} - {E\left( \xi_{j} \right)}} \right)}}} \\ \vdots \\ \frac{\frac{1}{\sqrt{\lambda_{r}}}{\sum\limits_{j = 1}^{M}\quad{b_{jr}\left( {\xi_{j} - {E\left( \xi_{j} \right)}} \right)}}}{0} \end{pmatrix}},$ so that Z_(j)=0 for j=r+1, . . . , M.

We also have $\begin{matrix} {{{cov}\left( {Z,Z} \right)} = {E\left( {Z,Z^{T}} \right)}} \\ {= {E\left( {{{DB}^{T}\left( {\xi - {E(\xi)}} \right)}\left( {\xi - {E(\xi)}} \right)^{T}{BD}} \right)}} \\ {= {{DB}^{T}{E\left( {\left( {\xi - {E(\xi)}} \right)\left( {\xi - {E(\xi)}} \right)^{T}} \right)}{BD}}} \\ {= {{DB}^{T}{{cov}\left( {\xi,\xi} \right)}{BD}}} \\ {= {{D\left( {\frac{\begin{matrix} \lambda_{1} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \lambda_{r} \end{matrix}}{0}❘\frac{0}{0}} \right)}D}} \\ {{= \left( {\frac{I_{r}}{0}❘\frac{0}{0}} \right)},} \end{matrix}$ (E(Z) = 0) where I_(r) is the r by r identity matrix. Put ${{B(r)}\overset{df}{=}\left( {b_{1}{\cdots }b_{r}} \right)},{{D(r)}\overset{df}{=}\begin{pmatrix} \sqrt{\lambda_{1}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \sqrt{\lambda_{r}} \end{pmatrix}}$ and ${Z(r)}\overset{df}{=}{\begin{pmatrix} Z_{1} \\ \vdots \\ Z_{r} \end{pmatrix}.}$

Now Z=DB^(T)(ξ−E(ξ)).

So D(r)⁻¹B(r)^(T)(ξ−E(ξ))=Z(r)

(ignoring the last M−r equations because Z_(r+1)= . . . =Z_(M)=0).

Thus (b₁| . . . |b_(r))^(T)(ξ−E(ξ))=D(r)Z(r).

Now each λ_(j) is the eigenvalue of cov(ξ,ξ) corresponding to the eigenvector b_(j),

and {b₁, . . . , b_(M)} is an orthonormal basis of R^(M). So we have λ_(j)=Q_(cov(ξ,ξ))(b_(j)) for j=1, . . . , M, where Q_(cov(ξ,ξ)) is the quadratic form associated with the matrix cov(ξ,ξ). But λ_(j)=0, for j=r+1, . . . , M, so that b_(j) ^(T)(ξ−E(ξ))=0 a.e. for j=r+1, . . . , M. Therefore we have (b_(r+1)| . . . |b_(M))^(T)(ξ−E(ξ))=0 a.e.

Thus we have (b₁| . . . |b_(r))^(T)(ξ−E(ξ))=D(r)Z(r) and (b_(r+1)| . . . |b_(M))^(T)(ξ−E(ξ))=0 a.e.

Therefore (b₁| . . . |b_(r))^(T)ξ=(b₁| . . . b_(r))^(T)E(ξ)+D(r)Z(r)

and (b_(r+1)| . . . |b_(M))^(T)ξ=(b_(r+1)| . . . |b_(M))^(T)E(ξ) a.e.

Given that (b_(r+1)| . . . |b_(M))^(T)ξ=(b_(r+1)| . . . |b_(M))^(T)E(ξ) a.e.,

we make the assumption of consistency that (b _(r+1) | . . . |b _(M))^(T) x=(b _(r+1)| . . . |b_(M))^(T) E(ξ).

We now show that (ξ=x

B(r)^(T)ξ=B(r)^(T)x) a.e.

It is clear that ξ=x

B(r)^(T)ξ=B(r)^(T)x.

So suppose that B(r)^(T)ξ=B(r)^(T)x.

Now ${B^{T}\xi} = {\begin{pmatrix} {{B(r)}^{T}\xi} \\ {\left( {b_{r + 1}{\cdots }b_{M}} \right)^{T}\xi} \end{pmatrix}.}$

But B(r)^(T)ξ=B(r)^(T)x by hypothesis,

(b_(r+1)| . . . |b_(M))^(T)ξ=(b_(r+1)| . . . |b_(M))^(T)E(ξ) a.e. and (b_(r+1)| . . . |b_(M))^(T)E(ξ)=(b_(r+1)| . . . |b_(M))^(T)x by the assumption of consistency. Thus ${B^{T}\xi} = {{\begin{pmatrix} {{B(r)}^{T}x} \\ {\left( {b_{r + 1}{\cdots }b_{M}} \right)^{T}x} \end{pmatrix}\quad{a.e}}..}$ ${{{But}\begin{pmatrix} {{B(r)}^{T}x} \\ {\left( {b_{r + 1}{\cdots }b_{M}} \right)^{T}x} \end{pmatrix}} = {B^{T}x}},$ so that B^(T)ξ=B^(T)x a.e.

But B is orthogonal. Therefore ξ=x a.e.

So we have shown that B(r)^(T)ξ=B(r)^(T)x

(ξ=x a.e.),

which implies that (B(r)^(T)ξ=B(r)^(T)x

ξ=x) a.e.

Therefore (ξ=x

B(r)^(T)ξ=B(r)^(T)x) a.e.

So we have (ξ=x

B(r)^(T)E(ξ)+D(r)Z(r)=B(r)^(T)x) a.e.

Thus $\begin{matrix} {{E\left( {{\theta ❘\xi} = x} \right)} = {E\left( {{\theta ❘{{D(r)}{Z(r)}}} = {B(r)^{T}\left( {x - {E(\xi)}} \right)}} \right)}} \\ {= {E\left( {{\theta ❘{Z(r)}} = {{D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)}} \right)}} \end{matrix}.$

Now E(Z(r))=0 and cov(Z(r),Z(r))=I_(r) which is non-singular.

So, by the Theorem on Normal Correlation, we have $\begin{matrix} {E\left( {{\theta ❘{Z(r)}} = {D(r)^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)}} \right)} \\ {= \begin{matrix} {{{E(\theta)} + {{{cov}\left( {\theta,{Z(r)}} \right)}{{cov}\left( {{Z(r)},{Z(r)}} \right)}^{- 1}}}\quad} \\ \left( {{{D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)} - {E\left( {Z(r)} \right)}} \right) \end{matrix}} \\ {= {{E(\theta)} + {{{cov}\left( {\theta,{Z(r)}} \right)}{D(r)}^{- 1}{B(r)}^{T}{\left( {x - {E(\xi)}} \right).}}}} \end{matrix}$ Thus $\begin{matrix} {{E\left( {\left. \theta \middle| \xi \right. = x} \right)} = {{E(\theta)} + {{{cov}\left( {\theta,{Z(r)}} \right)}{D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)}}} \\ {= \begin{matrix} {{E(\theta)} + {{cov}\left( {\theta,{{D(r)}^{- 1}{B(r)}^{T}}}\quad \right.}} \\ {\left. \left( {\xi - {E(\xi)}} \right) \right){D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)} \end{matrix}} \\ {= {{E(\theta)} + {{{cov}\left( {\theta,{\xi - {E(\xi)}}} \right)}{B(r)}{D(r)}^{- 1}{D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)}}} \\ {= {{E(\theta)} + {{{cov}\left( {\theta,\xi} \right)}{B(r)}\begin{pmatrix} {1/\lambda_{1}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & {1/\lambda_{r}} \end{pmatrix}{B(r)}^{T}{\left( {x - {E(\xi)}} \right).}}}} \end{matrix}$

We now define ${{cov}\left( {\xi,\xi} \right)}^{\oplus}\overset{df}{=}{{B(r)}\begin{pmatrix} {1/\lambda_{1}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & {1/\lambda_{r}} \end{pmatrix}{{B(r)}^{T}.}}$

Referring to FIG. 2, E(θ|ξ=x) is calculated 54.

Then we get E(θ|ξ=x)=E(θ)+cov(θ,ξ)cov(ξ,ξ)^(⊕)(x−E(ξ)).

We also have $\begin{matrix} {{cov}\left( {\theta,{\theta\left. {\xi = x} \right)}} \right.} \\ {= {{cov}\left( {\theta,{\theta\left. {{Z(r)} = {{D(r)}^{- 1}{B(r)}^{T}\left( {x - {E(\xi)}} \right)}} \right)}} \right.}} \\ {= {{cov}\left( {\theta,{\theta\left. {Z(r)} \right)}} \right.}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,{Z(r)}} \right)}{{cov}\left( {{Z(r)},{\left( {Z(r)} \right)^{- 1}{{cov}\left( {\theta,{Z(r)}} \right)}^{T}\left( {{by}\quad{the}\quad{Theorem}\quad{on}\quad{Normal}\quad{Correlation}} \right)}} \right.}}}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,{Z(r)}} \right)}I_{r}{{cov}\left( {\theta,{Z(r)}} \right)}^{T}}}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{cov}\left( {\theta,{{D(r)}^{- 1}{B(r)}^{T}\left( {\xi - {E(\xi)}} \right)}} \right)}}} \\ {{{cov}\left( {\theta,{{D(r)}^{- 1}{B(r)}^{T}\left( {\xi - {E(\xi)}} \right)}} \right)}^{T}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,{{D(r)}^{- 1}{B(r)}^{T}\xi}} \right)}{{cov}\left( {\theta,{{D(r)}^{- 1}{B(r)}^{T}\xi}} \right)}^{T}}}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,\xi} \right)}{B(r)}{D(r)}^{- 1}{D(r)}^{- 1}{B(r)}^{T}{{cov}\left( {\theta,\xi} \right)}^{T}}}} \\ {= {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{\oplus}{{{cov}\left( {\theta,\xi} \right)}^{T}.}}}} \end{matrix}$

Referring to FIG. 2, cov(θ,θ|ξ=x) is calculated 54.

Thus we have cov(θ,θ|ξ=x)=cov(θ,θ)−cov(θ,ξ)cov(ξ,ξ)^(⊕) cov(θ,ξ)^(T).

Note that if r=0, we have E(θ|ξ=x)=E(θ) and cov(θ,θ|ξ=x)=cov(θ,θ).

We also have ${{cov}\left( {\xi,\xi} \right)}^{\oplus}\overset{df}{=}{{{B\begin{pmatrix} \frac{1}{\lambda_{1}} & \quad & 0 & \quad \\ \quad & ⋰ & \quad & 0 \\ 0 & \quad & \frac{1}{\lambda_{r}} & \quad \\ \quad & 0 & \quad & 0 \end{pmatrix}}B^{T}} = {\left( {\sum\limits_{k = 1}^{r}\frac{b_{ik}b_{jk}}{\lambda_{k}}} \right)_{({i,j})}.}}$

Note that the construction of cov(ξ,ξ)^(⊕) does not depend on the normality of ξ. If cov(ξ,ξ) is non-singular, one can show that cov(ξ,ξ)^(⊕)=cov(ξ,ξ)⁻¹. One can also show that the value of cov(ξ,ξ)^(⊕) is independent of the choice and ordering of the members of the basis of eigenvectors of cov(ξ,ξ).

Note also that the derivation of the formulae for E(θ|ξ=x) and cov(θ,θ|ξ=x) only depends on the normality of $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ and not on our interpretation of θ and ξ as unknown and known rate changes, respectively.

We now give a slight generalisation of Theorem 3.3.4 of Y. L. Tong, The Multivariate Normal Distribution, Springer:

Suppose that $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ is unconditionally normal where ξ and θ are random vectors in R^(M) and R^(N), respectively. Let xεR^(M). Then θ, conditional on ξ=x, is normally distributed. Proof

First suppose that $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ is non-singular.

Let A be any M by N real matrix and define $\varphi_{A}\overset{df}{=}{\begin{pmatrix} I_{M} & 0 \\ A & I_{N} \end{pmatrix}.}$

Then φ_(A): R^(M)→R^(N) is non-singular, φ_(A) ⁻¹=φ_(−A) and det(φ_(A))=det(I_(M))det(I_(N))=1.

But φ_(A) non-singular and $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ non-singular normal imply that $\begin{pmatrix} \xi^{\prime} \\ \theta^{\prime} \end{pmatrix}\overset{df}{=}{{\varphi_{A}\begin{pmatrix} \xi \\ \theta \end{pmatrix}} = \begin{pmatrix} \xi \\ {{A\quad\xi} + \theta} \end{pmatrix}}$ is also non-singular normal.

We have ξ′=ξ and θ′=Aξ+θ. ${\left. {{{\left. {{\left. {{Then}\quad{E\left( \xi ’ \right.}} \right) = {E(\xi)}},{E\left( \theta ’ \right.}} \right) = {{{AE}(\xi)} + {E(\theta)}}},{{cov}\left( \xi ’ \right.},\xi}’} \right) = {{cov}\left( {\xi,\xi} \right)}},\begin{matrix} {{\left. {{{{cov}\left( \theta ’ \right.},\theta}’} \right) = {{cov}\left( {{{A\quad\xi} + \theta},{{A\quad\xi} + \theta}} \right)}},} \\ {= {{{cov}\left( {{A\quad\xi},{A\quad\xi}} \right)} + {{cov}\left( {{A\quad\xi},\theta} \right)} + {{cov}\left( {\theta,{A\quad\xi}} \right)} + {{cov}\left( {\theta,\theta} \right)}}} \\ {{= {{{{Acov}\left( {\xi,\xi} \right)}A^{T}} + {{Acov}\left( {\xi,\theta} \right)} + {{{cov}\left( {\theta,\xi} \right)}A^{T}} + {{cov}\left( {\theta,\theta} \right)}}},} \end{matrix}$ and $\begin{matrix} \left. {{{{cov}\left( \theta ’ \right.},\xi}’} \right) & \left. \left. \left( {{= {{cov}\left( \xi ’ \right.}},\theta}’ \right. \right)^{T} \right) \\ {= {{{cov}\left( {{A\quad\xi},\xi} \right)} + {{cov}\left( {\theta,\xi} \right)}}} & \quad \\ {= {{{Acov}\left( {\xi,\xi} \right)} + {{{cov}\left( {\theta,\xi} \right)}.}}} & \quad \end{matrix}$

We can now choose A to ensure that cov(θ′,ξ′)=0.

Thus we require Acov(ξ,ξ)+cov(θ,ξ)=0,

so that A=−cov(θ,ξ)cov(ξ,ξ)⁻¹ (ξ is non-singular).

Put $\psi\overset{df}{=}{\varphi_{{- {{cov}{({\theta,\xi})}}}\quad{cov}\quad{({\xi,\xi})}^{- 1}}.}$

Then ${\begin{pmatrix} \xi^{\prime} \\ \theta^{\prime} \end{pmatrix} = {{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} = \begin{pmatrix} \xi \\ {g\left( {\xi,\theta} \right)} \end{pmatrix}}},$ where ${{g\left( {x_{1},x_{2}} \right)}\overset{df}{=}{x_{2} - {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{- 1}x_{1}}}},$ for x₁εR^(M) and x₂εR^(N).

Then cov(ξ,g(ξ,θ))=0. But ξ and g(ξ,θ) are normal because $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ is normal.

Now ψ is non-singular and $\quad\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ is non-singular normal.

So ${\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} = \begin{pmatrix} \xi \\ {g\left( {\xi,\theta} \right)} \end{pmatrix}$ is non-singular normal.

Therefore the distribution function of $\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}$ is absolutely continuous. Notation

Let F_(X) denote the distribution function of X and f_(X) the density function of X, for any random variable X.

Then we have ${F_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} = {\int_{(\begin{matrix} {- \infty} \\ \vdots \\ {- \infty} \end{matrix})}^{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})}{f_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\quad{\mathbb{d}m_{1}}{\mathbb{d}m_{2}}}}$ for x₁εR^(M) and x₂εR^(N), where m₁ is M-dimensional Lebesgue measure and m₂ is N-dimensional Lebesgue measure.

Now ${f_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} = {\frac{1}{\left( {2\quad\pi} \right)^{\frac{M + N}{2}}\sqrt{\det\left( {{cov}\left( {{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}},{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)} \right)}}{\mathbb{e}}^{\frac{1}{2}Q}{{cov}\left( {{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}},{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)}^{{- 1}{({{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})} - {E{({\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}})}}})}}}$ ${But}\quad\begin{matrix} {{\det\left( {{cov}\left( {{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}},{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)} \right)} = {\det\left( {\psi^{2} \circ {{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)}} \\ {= {{\det(\psi)}^{2}{\det\left( {{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)} \right)}}} \\ {{= {\det\left( {{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)} \right)}},} \end{matrix}$ because det(ψ)=1.

We also have ${Q_{{{cov}{({{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}},{\psi{(\begin{matrix} {\xi`} \\ \theta \end{matrix})}}})}}^{- 1}}\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)} = {{\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)^{T}{{cov}\left( {{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}},{\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)}^{- 1}\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)} = {{\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)^{T}\left( {\psi\quad{{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}\psi^{T}} \right)^{- 1}\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)} = {{\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)^{T}\left( \psi^{- 1} \right)^{T}{{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}^{- 1}{\psi^{- 1}\left( {\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix} - {E\left( {\psi\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}} \right)}} = {{\left( {{\psi^{- 1}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} - {E\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)^{T}{{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)}^{- 1}\left( {{\psi^{- 1}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} - {E\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)} = {{Q_{{{cov}{({{(\begin{matrix} \xi \\ \theta \end{matrix})},{(\begin{matrix} \xi \\ \theta \end{matrix})}})}}^{- 1}}\left( {{\psi^{- 1}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} - {E\begin{pmatrix} \xi \\ \theta \end{pmatrix}}} \right)}.{So}}}}}}$ ${f_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} = {\frac{1}{\left( {2\quad\pi} \right)\frac{M + N}{2}\sqrt{\det\left( {{cov}\left( {\begin{pmatrix} \xi \\ \theta \end{pmatrix},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)} \right)}}{{\mathbb{e}}^{{- \frac{1}{2}}{Q_{{{cov}{({{(\begin{matrix} \xi \\ \theta \end{matrix})},{(\begin{matrix} \xi \\ \theta \end{matrix})}})}}^{- 1}}{({{\psi^{- 1}{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})}} - {E{(\begin{matrix} \xi \\ \theta \end{matrix})}}})}}}.}}$

Thus we have $f_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}} = {{f_{(\begin{matrix} \xi \\ \theta \end{matrix})} \circ \psi^{- 1}}.}$

Now we also have ${{{\det\left( \left( \psi^{- 1} \right)^{\prime} \right)}}\left( {{the}\quad{absolute}\quad{value}\quad{of}\quad{the}{\quad\quad}{determinant}\quad{of}\quad{the}\quad{Jacobian}\quad{of}\quad\psi^{- 1}} \right)} = {{{\det\left( \psi^{- 1} \right)}} = {\frac{1}{\det(\psi)} = 1.}}$ Thus ${{F_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} = {{\int_{(\begin{matrix} {- \infty} \\ \vdots \\ {- \infty} \end{matrix})}^{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})}{\left( {f_{(\begin{matrix} \xi \\ \theta \end{matrix})} \circ \psi^{- 1}} \right)\quad{\mathbb{d}m_{1}}{\mathbb{d}m_{2}}}} = {{\int_{(\begin{matrix} {- \infty} \\ \vdots \\ {- \infty} \end{matrix})}^{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})}{\left( {f_{(\begin{matrix} \xi \\ \theta \end{matrix})} \circ \psi^{- 1}} \right)\quad{{\det\left( \left( \psi^{- 1} \right)^{\prime} \right)}}{\mathbb{d}m_{1}}{\mathbb{d}m_{2}}}} = {{\int_{(\begin{matrix} {- \infty} \\ \vdots \\ {- \infty} \end{matrix})}^{\psi^{- 1}{(\begin{matrix} x_{1} \\ x_{2} \end{matrix})}}{f_{(\begin{matrix} \xi \\ \theta \end{matrix})}{\mathbb{d}m_{1}}{\mathbb{d}m_{2}}\quad\left( {{by}\quad a\quad{change}\quad{of}\quad{variable}} \right)}} = {{F_{(\begin{matrix} \xi \\ \theta \end{matrix})}\left( {\psi^{- 1}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} \right)} = {{F_{(\begin{matrix} \xi \\ \theta \end{matrix})}\begin{pmatrix} x_{1} \\ {x_{2} + {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{- 1}x_{1}}} \end{pmatrix}} = {{{F_{\theta}\left( {{{x_{2} + {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{- 1}x_{1}}}❘\xi} = x_{1}} \right)}{{F_{\xi}\left( x_{1} \right)}.{But}}\quad{F_{\psi{(\begin{matrix} \xi \\ \theta \end{matrix})}}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}}} = {{F_{(\begin{matrix} \xi \\ {g{({\xi,\theta})}} \end{matrix})}\begin{pmatrix} x_{1} \\ x_{2} \end{pmatrix}} = {{F_{g{({\xi,\theta})}}\left( x_{2} \right)}F_{\xi}\left( x_{1} \right)}}}}}}}}},$ because ξ and g(ξ, θ) are independent.

Thus F _(θ)(x ₂ +cov(θ,ξ)cov(ξ,ξ)⁻¹ x ₁ |ξ=x ₁)F _(ξ)(x ₁)=F _(g(ξ,θ))(x ₂)F _(ξ)(x ₁), for all x₁εR^(M) and all x₂εR^(N).

But ξ is non-singular, so that F_(ξ)(x₁)>0 for all x₁εR^(M).

Thus F_(θ)(x₂+cov(θ,ξ)cov(ξ,ξ)⁻¹x₁|ξ=x₁)=F_(g(ξ,θ))(x₂) for all x₁ and x₂.

Now take x₁=x.

Then F_(θ)(x₂+cov(θ,ξ)cov(ξ,ξ)⁻¹x|ξ=x)=F_(g(ξ,θ))(x₂) for all x₂εR^(N).

But g(ξ,θ) is normal and cov(ξ,θ)cov(ξ,ξ)⁻¹xεR^(N) is a constant.

Therefore the distribution of θ, conditional on ξ=x, is normal.

Now suppose that $\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad$ is singular. Put $M_{1}\overset{df}{=}{{rank}\left( {{cov}\left( {\xi,\xi} \right)} \right)}$ and $N_{1}\overset{df}{=}{{{rank}\left( {{{cov}\begin{pmatrix} \xi \\ \theta \end{pmatrix}},\begin{pmatrix} \xi \\ \theta \end{pmatrix}} \right)} - {M_{1}.}}$

Then there exist x′εR^(M) ¹ , random vectors ξ′ and θ′ of dimension M₁ and N₁ respectively, an M by M₁ matrix A, an N by M₁ matrix B₁ and an N by N₁ matrix B₂ such that ${\begin{pmatrix} \xi \\ \theta \end{pmatrix} = {\left( {\frac{A}{B_{1}}❘\frac{0}{B_{2}}} \right)\begin{pmatrix} \xi^{\prime} \\ \theta^{\prime} \end{pmatrix}\quad{a.e.}}},$ (ξ=x

ξ′=x′) a.e. and $\begin{pmatrix} \xi^{\prime} \\ \theta^{\prime} \end{pmatrix}\quad$ is non-singular normal. Because $\begin{pmatrix} \xi^{\prime} \\ \theta^{\prime} \end{pmatrix}\quad$ is non-singular normal, θ′, conditional on ξ′=x′, is normally distributed. But when ξ′=x′, we have θ=B₁x′+B₂θ′ a.e., where B₁x′ is constant and θ′ is normal. Thus θ, conditional on ξ′=x′, is an affine function of a normally distributed random vector and is therefore normal. But (ξ′=x′

ξ=x) a.e. Therefore θ, conditional on ξ=x, is normally distributed.

Let us now return to our interpretation of ξ and θ as known and unknown rate changes. We have shown that θ, conditional on ξ=x, is N(E(θ|ξ=x),cov(θ,θ|ξ=x)).

Now ${E\left( {{\theta ❘\xi} = x} \right)} = \begin{pmatrix} {E\left( {{\theta_{1}❘\xi} = x} \right)} \\ \vdots \\ {E\left( {{\theta_{N}❘\xi} = x} \right)} \end{pmatrix}$ and cov(θ,θ|ξ=x)=(cov(θ_(k),θ_(k′)|ξ=x))_((k,k′)).

For Δ_(i) ^((j)) unknown, let α_(ij)ε{1, . . . , , N} be its index in θ, so that Δ_(i) ^((j))=θ_(α) _(ij) .

Conditional Distributions of Rate Changes

For each unknown Δ_(i) ^((j)), we have E(Δ_(i) ^((j))|ξ=x)=E(θ_(α) _(ij) |ξ=x) and var(Δ_(i) ^((j))|ξ=x)=cov(θ_(α) _(ij) ,θ_(α) _(ij) |ξ=x), so that Δ_(i) ^((j)), conditional on ξ=x, is N(E(Δ_(i) ^((j))|ξ=x),var(Δ_(i) ^((j))|ξ=x)). For each known Δ_(i) ^((j)), let x_(i) ^((j)) be the known value of Δ_(i) ^((j)). Then E(Δ_(i) ^((j))|ξ=x)=x_(i) ^((j)) and var(Δ_(i) ^((j))|ξ=x)=0, so that Δ_(i) ^((j)), conditional on ξ=x, is N(x_(i) ^((j)),0). Thus we know E(Δ_(i) ^((j))|ξ=x) and cov(Δ_(i) ^((j))|ξ=x) for all Δ_(i) ^((j)) (and Δ_(i) ^((j)) is normally distributed).

Now, for every pair (Δ_(i) ₁ ^((j) ¹ ⁾,Δ_(i) ₂ ^((j) ² ⁾, we have ${{cov}\left( {\Delta_{i_{1}}^{(j_{1})},{{\Delta_{i_{2}}^{(j_{2})}❘\xi} = x}} \right)} = \left\{ \begin{matrix} 0 & {{if}\quad{either}\quad{of}\quad\Delta_{i_{1}}^{(j_{1})}{and}\quad\Delta_{i_{2}}^{(j_{2})}{is}\quad{known}} \\ {{cov}\left( {\theta_{\alpha_{i_{1}j_{1}}},{{\theta_{\alpha_{i_{2}j_{2}}}❘\xi} = x}} \right.} & {otherwise} \end{matrix} \right.$

Then, for any j and i<i′, we can calculate the conditional mean of a rate change: ${E\left( {{\Delta_{t_{i},t_{i}^{\prime}}^{(j)}❘\xi} = x} \right)} = {{E\left( {{{\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad\Delta_{k}^{(j)}}❘\xi} = x} \right)}{\sum\limits_{k = {i + 1}}^{i^{\prime}}\quad{E\left( {{\Delta_{k}^{(j)}❘\xi} = x} \right)}}}$ and the conditional variance of a rate change: ${{var}\left( {{\Delta_{t_{i},t_{i}^{\prime}}^{(j)}❘\xi} = x} \right)} = {\sum\limits_{k_{1} = {i + 1}}^{i^{\prime}}{\sum\limits_{k_{2} = {i + 1}}^{i^{\prime}}{{cov}\left( {\Delta_{k_{1}}^{(j)},{{\Delta_{k_{2}}^{(j)}❘\xi} = x}} \right)}}}$

Thus Δ_(t) _(i) _(,t) _(i′) ^((j)), conditional on ξ=x, is N(E(Δ_(t) _(i) _(,t) _(i′) ^((j))|ξ=x),var(Δ_(t) _(i) _(,t) _(i′) ^((j))|ξ=x)).

We can also calculate the conditional covariance of a pair of rate changes: ${{cov}\left( {\Delta_{t_{i_{1}},t_{i_{1}}^{\prime}}^{(j_{1})},{{\Delta_{t_{i_{2}},t_{i_{2}}^{\prime}}^{(j_{2})}❘\xi} = x}} \right)} = {\sum\limits_{k_{1} = {i_{1} + 1}}^{i_{1}^{\prime}}{\sum\limits_{k_{2} = {i_{2} + 1}}^{i_{2}^{\prime}}{{cov}\left( {\Delta_{k_{1}}^{(j_{1})},{{\Delta_{k_{2}}^{(j_{2})}❘\xi} = x}} \right)}}}$ and the conditional correlation of a pair of rate changes: ${\rho\left( {\Delta_{t_{i_{1}},t_{i_{1}^{\prime}}}^{(j_{1})},{{\Delta_{t_{i_{2}},t_{i_{2}^{\prime}}}^{(j_{2})}❘\xi} = x}} \right)} = \frac{{cov}\left( {\Delta_{t_{i_{1}},t_{i_{1}^{\prime}}}^{(j_{1})},{{\Delta_{t_{i_{2}},t_{i_{2}^{\prime}}}^{(j_{2})}❘\xi} = x}} \right)}{\sqrt{{var}\left( {{\Delta_{t_{i_{1}},t_{i_{1}^{\prime}}}^{(j_{1})}❘\xi} = x} \right)}\sqrt{{var}\left( {{\Delta_{t_{i_{2}},t_{i_{2}^{\prime}}}^{(j_{2})}❘\xi} = x} \right)}}$ provided that var(Δ_(t_(i₁), t_(i_(1^(′))))^((j₁))|ξ = x) > 0  and  var(Δ_(t_(i₂), t_(i_(2^(′))))^((j₂))|ξ = x) > 0.

We can clearly also calculate the conditional multivariate normal distribution of any vector of rate changes.

We will make use of the following well-known result:

Lemma

If X˜N(μ,σ²), then ${E\left( {\mathbb{e}}^{x} \right)} = {\mathbb{e}}^{\mu + {\frac{1}{2}\sigma^{2}}}$ and var(e^(X))=e^(2μ+σ) ² (e^(σ) Proof

We use integration by substitution.

We have $\begin{matrix} {{E\left( {\mathbb{e}}^{x} \right)} = {\int_{- \infty}^{+ \infty}{{\mathbb{e}}^{x}\frac{1}{\sigma\sqrt{2\pi}}{\mathbb{e}}^{{- \frac{1}{2}}{(\frac{x - \mu}{\sigma})}^{2}}\quad{\mathbb{d}x}}}} \\ {= {\int_{- \infty}^{+ \infty}{\frac{1}{\sigma\sqrt{2\pi}}{\mathbb{e}}^{{- \frac{1}{2}}{({{(\frac{x - \mu}{\sigma})}^{2} - {2x}})}}\quad{{\mathbb{d}x}.}}}} \end{matrix}$

Now $\begin{matrix} {{\left( \frac{x - \mu}{\sigma} \right)^{2} - {2x}} = {\left( \frac{x - \mu}{\sigma} \right)^{2} - {2{\sigma\left( \frac{x - \mu}{\sigma} \right)}} - {2\mu}}} \\ {= {\left( {\frac{x - \mu}{\sigma} - \sigma} \right)^{2} - {2\mu} - {\sigma^{2}.}}} \end{matrix}$

Let us make the substitution $y\overset{df}{=}{\frac{x - \mu}{\sigma} - {\sigma.}}$

Then $\frac{\mathbb{d}y}{\mathbb{d}x} = {\frac{1}{\sigma}\quad{and}}$ $\begin{matrix} {{E\left( {\mathbb{e}}^{x} \right)} = {\int_{- \infty}^{+ \infty}{\frac{1}{\sigma\sqrt{2\pi}}{\mathbb{e}}^{{- \frac{1}{2}}y^{2}}{\mathbb{e}}^{{- \frac{1}{2}}{({{{- 2}\mu} - \sigma^{2}})}}\quad{\mathbb{d}x}}}} \\ {= {{\mathbb{e}}^{\mu + {\frac{1}{2}\sigma^{2}}}{\int_{- \infty}^{+ \infty}{\frac{1}{\sigma\sqrt{2\pi}}\quad{\mathbb{e}}^{{- \frac{1}{2}}y^{2}}{\mathbb{d}x}}}}} \\ {= {{\mathbb{e}}^{\mu + {\frac{1}{2}\sigma^{2}}}{\int_{- \infty}^{+ \infty}{\frac{1}{\sqrt{2\pi}}\quad{\mathbb{e}}^{{- \frac{1}{2}}y^{2}}\frac{\mathbb{d}y}{\mathbb{d}x}{\mathbb{d}x}}}}} \\ {= {{\mathbb{e}}^{\mu + {\frac{1}{2}\sigma^{2}}}{\int_{- \infty}^{+ \infty}{\frac{1}{\sqrt{2\pi}}\quad{\mathbb{e}}^{{- \frac{1}{2}}y^{2}}{\mathbb{d}y}}}}} \\ {= {{\mathbb{e}}^{\mu + {\frac{1}{2}\sigma^{2}}}.}} \end{matrix}$

Now put Y=e^(X), so that Y²=e^(2X).

But 2X˜N(2μ,4σ²), so that ${E\left( Y^{2} \right)} = {{\mathbb{e}}^{{2\mu} + \frac{4\sigma^{2}}{2}} = {{\mathbb{e}}^{2{({\mu + \sigma^{2}})}}.}}$

Then var(e^(X))=var(Y)=E(Y²)−(E(Y))²=e^(2(μ+σ) ² ⁾−e^(2μ+σ) ² =e^(2μ+σ) ² (e^(σ) ² −1).

Marginal Distributions of Rates 30

Let φ be a condition expressing the fact that the known rates take their known values. Then E(Δ_(t) _(i) _(,t) _(i′) ^((j))|φ)=E(Δ_(t) _(i) _(,t) _(i′) ^((j))|ξ=x), and var(Δ_(t) _(i) _(,t) _(i′) ^((j))|φ)=var(Δ_(t) _(i) _(,t) _(i′) ^((j))|ξ=x), and so on. We wish to calculate the distribution of R_(t) _(i) ^((j)), conditional on φ, for each unknown R_(t) _(i) ^((j)) where jε{1, . . . , m} and iε{0, 1, . . . , n}. Let jε{1, . . . , m}. We suppose that R_(t) _(k) ^((j)) is known for some k.

Forward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k<i, and R_(t) _(α) ^((j)) is not known for k<α<i.

Case R^((j)) BM

We have Δ_(t) _(k) _(,t) _(i) ^((j))=R_(t) _(i) ^((j))−R_(t) _(k) ^((j)), so that R_(t) _(i) ^((j))=R_(t) _(k) ^((j))+Δ_(t) _(k) _(,t) _(i) ^((j)).

Then R_(t) _(i) ^((j)), conditional on φ, is N(R_(t) _(k) ^((j))+E(Δ_(t) _(k) _(,t) _(i) ^((j))|ξx),var(Δ_(t) _(k) _(,t) _(i) ^((j))|ξ=x)).

Case R^((j)) GBM

We have Δ_(t_(k), t_(i))^((j)) = ln (R_(t_(i))^((j))/R_(t_(k))^((j))), so that ln(R_(t) _(i) ^((j)))=ln(R_(t) _(k) ^((j)))+Δ_(t) _(k) _(,t) _(i) ^((j)).

Then ln(R_(t) _(i) ^((j)), conditional on φ, is N(ln(R_(t) _(k) ^((j)))+E(Δ_(t) _(k) _(,t) _(i) ^((j))|ξ=x),var(Δ_(t) _(k) _(,t) _(i) ^((j))|ξ=x)).

If we put ${\mu\overset{df}{=}{{{\ln\left( R_{t_{k}}^{(j)} \right)} + {{E\left( {{\Delta_{t_{k},t_{i}}^{(j)}\text{❘}\xi} = x} \right)}\quad{and}\quad\sigma^{2}}}\overset{df}{=}{{var}\left( {{\Delta_{t_{k},t_{i}}^{(j)}\text{❘}\xi} = x} \right)}}},$ we also have ${E\left( {R_{t_{i}}^{(j)}❘\varphi} \right)} = {\mathbb{e}}^{\mu + \frac{\sigma^{2}}{2}}$ and var(R_(t) _(i) ^((j))|φ)=e^(2μ+σ) ² (e^(σ) ² −1). Backward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k>i, and R_(t) _(α) ^((j)) is not known for i<α<k.

Case R^((j)) BM

We have Δ_(t) _(i) _(,t) _(k) ^((j))=R_(t) _(k) ^((j))−R_(t) _(i) ^((j)), so that R_(t) _(i) ^((j))=R_(t) _(k) ^((j))−Δ_(t) _(i) _(,t) _(k) ^((j)).

Then R_(t) _(i) ^((j)), conditional on φ, is N(R_(t) _(k) ^((j))−E(Δ_(t) _(i) _(,t) _(k) ^((j))|ξx),var(Δ_(t) _(i) _(,t) _(k) ^((j))|ξ=x)).

Case R^((j)) GBM

We have Δ_(t_(i), t_(k))^((j)) = ln (R_(t_(k))^((j))/R_(t_(i))^((j))), so that ln(R_(t) _(i) ^((j)))=ln(R_(t) _(k) ^((j)))−Δ_(t) _(i) _(,t) _(k) ^((j)).

Then ln(R_(t) _(i) ^((j))), conditional on φ, is N(ln(R_(t) _(k) ^((j)))−E(Δ_(t) _(i) _(,t) _(k) ^((j))|ξ=x),var(Δ_(t) _(i) _(,t) _(k) ^((j))|ξ=x)).

If we put ${\mu\overset{df}{=}{{{\ln\left( R_{t_{k}}^{(j)} \right)} - {{E\left( {{\Delta_{t_{i},t_{k}}^{(j)}\text{❘}\xi} = x} \right)}\quad{and}\quad\sigma^{2}}}\overset{df}{=}{{var}\left( {{\Delta_{t_{i},t_{k}}^{(j)}\text{❘}\xi} = x} \right)}}},$ we also have ${E\left( {R_{t_{i}}^{(j)}❘\varphi} \right)} = {\mathbb{e}}^{\mu + \frac{\sigma^{2}}{2}}$ and var(R_(t) _(i) ^((j))|φ)=e^(2μ+σ) ² (e^(σ) ² −1). Filling the Unknown Rates 56

We now give three methods of filling the unknown rates. Using the first method, we fill the unknown rates in such a way that the rate changes take their expected values conditional on φ. This method is equivalent to filling the unknown rates with their conditional modes (conditional on φ). Using the second method, we fill the unknown rates with their expected values conditional on φ. Using the third method, we simulate the unknown rates conditional on φ. In each case, we suppose that, for each j, R_(t) _(k) ^((j)) is known for some k. For each unknown rate R_(t) _(i) ^((j)), we will let $\overset{\sim}{R_{t_{i}}^{(j)}}$ denote its filled value. Method 1: Expected Rate Changes 31

We set each unknown Δ_(i) ^((j)) to E(Δ_(i) ^((j))|ξ=x) and “back out” the unknown rates.

Forward Calculation

Suppose $\overset{\sim}{R_{t_{i}}^{(j)}}$ is not known and R_(t) _(k) ^((j)) is known for some k<i, and R_(t) _(α) ^((j)) is not known for k<α<i. Case R^((j)) BM

We have ${{{\overset{\sim}{R_{t_{i}}^{(j)}} - R_{t_{k}}^{(j)}} = {E\left( {{\Delta_{t_{k},t_{i}}^{(j)}\text{❘}\xi} = x} \right)}},}\quad$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)} + {E\left( {\Delta_{t_{k},t_{i}}^{(j)}{\left. {\xi = x} \right).}} \right.}}$ Case R^((j)) GBM

We have ${\left( \frac{{\overset{\sim}{R}}_{t_{i}}^{(j)}}{R_{t_{k}}^{(j)}} \right) = {E\quad\left( {{\Delta_{t_{k},t_{i}}^{(j)}❘\xi} = x} \right)}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)}\exp\quad\left( {E\left( {\Delta_{t_{k},t_{i}}^{(j)}\left. {\xi = x} \right)} \right)} \right.}$ Backward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k>i, and R_(t) _(α) ^((j)) is not known for i<α<k.

Case R^((j)) BM

We have ${R_{t_{k}}^{(j)} - {\overset{\sim}{R}}_{t_{i}}^{(j)}} = {E\left( {{\Delta_{t_{i},t_{k}}^{(j)}\left. {\xi = x} \right)},} \right.}$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)} - {E\left( {\Delta_{t_{i},t_{k}}^{(j)}{\left. {\xi = x} \right).}} \right.}}$ Case R^((j)) GBM

We have ${\left( \frac{R_{t_{k}}^{(j)}}{{\overset{\sim}{R}}_{t_{i}}^{(j)}} \right) = {E\quad\left( {{\Delta_{t_{i},t_{k}}^{(j)}❘\xi} = x} \right)}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)}\exp\quad\left( {- {{E\left( {\Delta_{t_{i},t_{k}}^{(j)}\left. {\xi = x} \right)} \right)}.}} \right.}$ Method 2: Expected Rates 32

We take ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {E\left( {R_{i}^{(j)}\left. \varphi \right)} \right.}$ for each unknown rate R_(t) _(i) ^((j)). Forward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k<i, and R_(t) _(α) ^((j)) is not known for k<α<i.

Case R^((j)) BM

We have R_(t) _(i) ^((j))−R_(t) _(k) ^((j))=Δ_(t) _(k) _(,t) _(i) ^((j)), so that R_(t) _(i) ^((j))=R_(t) _(k) ^((j))+Δ_(t) _(k) _(,t) _(i) ^((j)).

Then $\begin{matrix} {\overset{\sim}{R_{t_{i}}^{(j)}} = {E\left( {R_{t_{i}}^{(j)}❘\varphi} \right)}} \\ {= {R_{t_{k}}^{(j)} + {E\left( {\Delta_{t_{k},t_{i}}^{(j)}❘\varphi} \right)}}} \\ {= {R_{k}^{(j)} + {E\left( {{\Delta_{t_{k},t_{i}}^{(j)}❘\xi} = x} \right)}}} \end{matrix}$ Case R^((j)) GBM

We have ln(R_(t) _(i) ^((j))/R_(t) _(k) ^((j)))=Δ_(t) _(k) _(,t) _(i) ^((j)),

so that R_(t) _(i) ^((j))=R_(t) _(k) ^((j))exp(Δ_(t) _(k) _(,t) _(i) ^((j))).

Then $\begin{matrix} {\overset{\sim}{R_{t_{i}}^{(j)}} = {E\left( {{R_{t_{k}}^{(j)}{\exp\left( \Delta_{t_{k},t_{i}}^{(j)} \right)}}❘\varphi} \right)}} \\ {= {R_{t_{k}}^{(j)}{E\left( {{\exp\left( \Delta_{t_{k},t_{i}}^{(j)} \right)}❘\varphi} \right)}}} \\ {= {R_{t_{k}}^{(j)}{\exp\left( {{E\left( {\Delta_{t_{k},t_{i}}^{(j)}❘\varphi} \right)} + {\frac{1}{2}{{var}\left( {\Delta_{t_{k},t_{i}}^{(j)}❘\varphi} \right)}}} \right)}}} \\ {= {R_{t_{k}}^{(j)}{{\exp\left( {{E\left( {{\Delta_{t_{k},t_{i}}^{(j)}❘\xi} = x} \right)} + {\frac{1}{2}{{var}\left( {{\Delta_{t_{k},t_{i}}^{(j)}❘\xi} = x} \right)}}} \right)}.}}} \end{matrix}$ ${\left( \frac{R_{t_{i}}^{(j)}}{R_{t_{k}}^{(j)}} \right) = \Delta_{t_{k},t_{i}}^{(j)}},$ Backward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k>i, and R_(t) _(α) ^((j)) is not known for i<α<k.

Case R^((j)) BM

We have (R_(t) _(k) ^((j))−R_(t) _(i) ^((j))=Δ_(t) _(i) _(,t) _(k) ^((j)),

so that (R_(t) _(i) ^((j))−R_(t) _(k) ^((j))=Δ_(t) _(i) _(,t) _(k) ^((j)).

Then ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {E\left( {{R_{t_{i}}^{(j)}\left. \varphi \right)} = {R_{t_{k}}^{(j)} - {E\left( {\Delta_{t_{i},t_{k}}^{(j)}{\left. {\xi = x} \right).}} \right.}}} \right.}$ Case R^((j)) GBM

We have ln ${\left( \frac{R_{t_{k}}^{(j)}}{R_{t_{i}}^{(j)}} \right) = \Delta_{t_{i},t_{k}}^{(j)}},$ so that R_(t) _(i) ^((j))=R_(t) _(k) ^((j))exp(−Δ_(t) _(i) _(,t) _(k) ^((j))).

Then $\begin{matrix} {\overset{\sim}{R_{t_{i}}^{(j)}} = {E\left( {R_{t_{i}}^{(j)}❘\varphi} \right)}} \\ {= {R_{t_{k}}^{(j)}{{\exp\left( {{- {E\left( {{\Delta_{t_{i},t_{k}}^{(j)}❘\xi} = x} \right)}} + {\frac{1}{2}{{var}\left( {{\Delta_{t_{i},t_{k}}^{(j)}❘\xi} = x} \right)}}} \right)}.}}} \end{matrix}$ Method 3: Simulated Rates 33

The approach here is to take a random drawing {tilde over (θ)} from N(E(θ|ξ=x),cov(θ,θ|ξ=x)) which, together with the known rates, then determines ${\overset{\sim}{R}}_{t_{i}}^{(j)}$ for each unknown rate R_(t) _(i) ^((j)). There is an orthonormal basis {s₁, . . . , s_(N)} of R^(N) consisting of eigenvectors of cov(θ,θ|ξ=x). Say $s_{j} = \begin{pmatrix} s_{1j} \\ \vdots \\ s_{Nj} \end{pmatrix}$ for j 1, . . . , N. Put $S\overset{df}{=}{\left( {s_{1}{\ldots }s_{N}} \right) = {\left( s_{ij} \right)_{({i,j})}.}}$

Then S is orthogonal and ${{S^{T}{{cov}\left( {\theta,{{\theta ❘\xi} = x}} \right)}S} = \begin{pmatrix} \mu_{1} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \mu_{N} \end{pmatrix}},$ where μ_(j) is the eigenvalue of cov(θ,θ|ξ=x) corresponding to the eigenvector s_(j), for j=1, . . . , N. Without loss of generality, there is a unique t such that 0≦t≦N and μ₁≧μ₂≧ . . . ≧μ_(t)<0 and μ_(j)=0 for j=t+1, . . . , N (reordering the columns of B and renaming the eigenvectors and eigenvalues if necessary).

If t=0, we have cov(θ,θ|ξ=x)=0, so that we can take {tilde over (θ)}=E(θ|ξ=x).

So suppose that t>0.

Let η˜N(E(θ|ξ=x),cov(θ,θ|ξ=x)). We can think of η as “θ conditional on ξ=x”. Let E*( ) and cov*(,) denote the expectation and covariance operators, respectively, arising out of the conditional distribution N(E(θ|ξ=x),cov(θ,θ|ξ=x)). Then we have E*(η)=E(θ|ξ=x) and cov*(η,η)=cov(θ,θ|ξ=x). ${{Put}\quad\Delta^{\oplus}}\overset{df}{=}\left( {\frac{\begin{matrix} \frac{1}{\sqrt{\mu_{1}}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \frac{1}{\sqrt{\mu_{t}}} \end{matrix}}{0}❘\frac{\begin{matrix} \quad \\ \quad \\ 0 \\ \quad \\ \quad \end{matrix}}{0}} \right)$ and $W\overset{df}{=}{\Delta^{\oplus}{{S^{T}\left( {\eta - {E^{*}(\eta)}} \right)}.}}$

Then ${{{E*(W)} = 0},{{{cov}*\left( {W,W} \right)} = \left( {\frac{I_{t}}{0}❘\frac{0}{0}} \right)}}\quad$ and ${W = \begin{pmatrix} {\frac{1}{\sqrt{\mu_{1}}}{\sum\limits_{j = 1}^{N}{s_{j1}\left( {\eta_{j} - {E*\left( \eta_{j} \right)}} \right)}}} \\ \vdots \\ \frac{\frac{1}{\sqrt{\mu_{t}}}{\sum\limits_{j = 1}^{N}{s_{j1}\left( {\eta_{j} - {E*\left( \eta_{j} \right)}} \right)}}}{0} \end{pmatrix}},$ so that W_(j)=0 for j=t+1, . . . , N.

Thus W₁, . . . , W_(t) are uncorrelated N(0,1) and therefore independent.

Now ${{{put}\quad{S(t)}}\overset{df}{=}\left( {s_{1}{\quad\ldots\quad }s_{t}} \right)},{{\Delta(t)}\overset{df}{=}{{\begin{pmatrix} \sqrt{\mu_{1}} & \quad & 0 \\ \quad & ⋰ & \quad \\ 0 & \quad & \sqrt{\mu_{t}} \end{pmatrix}\quad{and}\quad{W(t)}}\overset{df}{=}{\begin{pmatrix} W_{1} \\ \vdots \\ W_{t} \end{pmatrix}.}}}$

Now W=Δ^(⊕)S^(T)(η−E*(η)) implies that Δ(t)⁻¹S(t)^(T)(η−E*(η))=W(t), so that S(t)^(T)(η−E*(η))=Δ(t)W(t). We also have (s_(t+1)| . . . |s_(N))^(T)(η−E*(η))=0 a.e.

But S(t)=(s₁| . . . |s_(t)). Thus we have ${S^{T}\left( {\eta - {E*(\eta)}} \right)} = {{\left( \frac{{\Delta(t)}{W(t)}}{0} \right)\quad{a.e}}..}$

Then $\eta = {{E*(\eta)} + {S\left( \frac{{\Delta(t)}{W(t)}}{0} \right)}}$ a.e., because S is orthogonal.

Let {tilde over (W)}₁, . . . , {tilde over (W)}_(t) be uncorrelated drawings from N(0,1). Then $\overset{\sim}{\theta} = {{E\left( {{\theta ❘\xi} = x} \right)} + {S\begin{pmatrix} {\sqrt{\mu_{1\quad}}{\overset{\sim}{W}}_{1}} \\ \vdots \\ \frac{\sqrt{\mu_{t\quad}}{\overset{\sim}{W}}_{t}}{0} \end{pmatrix}}}$ can be taken to be a random drawing from N(E(θ|ξ=x),cov(θ,θ|ξ=x))

So we have shown how to take a random drawing {tilde over (θ)} from N(E(θ|ξ=x),cov(θ,θ|ξ=x)) for t=0 and for t>0.

For Δ_(i) ^((j)) unknown, we can now take its simulated value, {tilde over (Δ)}_(i) ^((j)), to be {tilde over (θ)}_(α) _(ij) .

Finally, we use these {tilde over (Δ)}_(i) ^((j)) to derive simulated values of the unknown rates:

Forward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k<i and R_(t) _(α) ^((j)) is not known for k<α<i.

Case R^((j)) BM

We require ${{{\overset{\sim}{R}}_{t_{i}}^{(j)} - R_{t_{k}}^{(j)}} = {\sum\limits_{\alpha = {k + 1}}^{i}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)} + {\sum\limits_{\alpha = {k + 1}}^{i}\quad{{\overset{\sim}{\Delta}}_{\alpha}^{(j)}.}}}$ Case R^((j)) GBM

We require ${{\ln\left( {{\overset{\sim}{R}}_{t_{i}}^{(j)}/R_{t_{k}}^{(j)}} \right)} = {\sum\limits_{\alpha = {k + 1}}^{i}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)}{{\exp\left( {\sum\limits_{\alpha = {k + 1}}^{i}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}} \right)}.}}$ Backward Calculation

Suppose R_(t) _(i) ^((j)) is not known and R_(t) _(k) ^((j)) is known for some k>i and R_(t) _(α) ^((j)) is not known for i<α<k.

Case R^((j)) BM

We require ${{R_{t_{k}}^{(j)} - {\overset{\sim}{R}}_{t_{i}}^{(j)}} = {\sum\limits_{\alpha = {i + 1}}^{k}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)} - {\sum\limits_{\alpha = {i + 1}}^{k}\quad{{\overset{\sim}{\Delta}}_{\alpha}^{(j)}.}}}$ Case R^((j)) GBM

We require ${{\ln\left( {R_{t_{k}}^{(j)}/{\overset{\sim}{R}}_{t_{i}}^{(j)}} \right)} = {\sum\limits_{\alpha = {i + 1}}^{k}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}}},$ so that ${\overset{\sim}{R}}_{t_{i}}^{(j)} = {R_{t_{k}}^{(j)}{{\exp\left( {- {\sum\limits_{\alpha = {i + 1}}^{k}\quad{\overset{\sim}{\Delta}}_{\alpha}^{(j)}}} \right)}.}}$ Singularity and the Assumption of Consistency

It is possible to get anomalous results if the known rate changes are not consistent with the dependence relations, obtaining almost everywhere, that are implied by the unconditional rate dynamics, that is, if the assumption of consistency (b_(r+1)| . . . |b_(M))^(T)x=(b_(r+1)| . . . |b_(M))^(T)E(ξ) is not satisfied. This assumption of consistency can only fail to be satisfied if cov(ξ,ξ) is singular. How can one guarantee that cov(ξ,ξ) is non-singular ? cov(ξ,ξ) is certainly non-singular if the unconditional covariance matrix of rate changes per unit interval of time for all the rate series in question is non-singular. But we can weaken this condition. One can show that if the unconditional covariance matrix of rate changes per unit interval of time for the rate series for which there are known rate changes (runs of length greater than or equal to one) is non-singular, then cov(ξ,ξ) is also non-singular, so that the assumption of consistency is necessarily satisfied. Note that this is a sufficient, but not a necessary, condition for the assumption of consistency to be satisfied.

Worked Example

We give an example with two rate series and two time intervals because we wish to illustrate correlation effects across rate series and across time intervals. We will give calculated values rounded to six decimal places.

Let the rate series be R⁽¹⁾ and R⁽²⁾, so that m, the number of rate series, is 2.

We first specify the unconditional rate dynamics.

We suppose that R⁽¹⁾ is a Geometric Brownian Motion and R⁽²⁾ is a Brownian Motion.

Let the unconditional mean vector, μ, be $\begin{pmatrix} 1 \\ 0 \end{pmatrix}\quad$ and the unconditional volatility vector, σ, be $\begin{pmatrix} {1/2} \\ 1 \end{pmatrix}.$ These are both expressed per unit interval of time. Let the unconditional correlation matrix, ${\rho = \left( \rho_{ij} \right)_{({i,j})}},{{be}\quad{\begin{pmatrix} 1 & \frac{1}{2} \\ \frac{1}{2} & 1 \end{pmatrix}.}}$ Then the unconditional covariance matrix per unit interval of time, ${\kappa = \left( \kappa_{ij} \right)_{({i,j})}},{{{is}\begin{pmatrix} \sigma_{1}^{2} & {\rho_{12}\sigma_{1}\sigma_{2}} \\ {\rho_{21}\sigma_{2}\sigma_{1}} & \sigma_{2}^{2} \end{pmatrix}} = {\begin{pmatrix} \frac{1}{4} & \frac{1}{4} \\ \frac{1}{4} & 1 \end{pmatrix}.}}$

We now specify the incomplete rate data.

We take n, the number of time intervals, to be 2. We consider three times t₀=0, t₁=1 and t₂=2. Then ${\Delta\quad t_{1}}\overset{df}{=}{{t_{1} - t_{0}} = {{1\quad{and}\quad\Delta\quad t_{2}}\overset{df}{=}{{t_{2} - t_{1}} = 1.}}}$

We put $R\overset{df}{=}\begin{pmatrix} R_{0}^{(1)} & R_{0}^{(2)} \\ R_{1}^{(1)} & R_{1}^{(2)} \\ R_{2}^{(1)} & R_{2}^{(2)} \end{pmatrix}$ and suppose that ${R = \begin{pmatrix} 1 & {1\frac{1}{2}} \\ * & 1 \\ 2 & * \end{pmatrix}},$ where asterisks denote unknown rates. That is, we suppose that R₀ ⁽¹⁾=1, R₂ ⁽¹⁾=2, R₀ ⁽²⁾ =1½ and R ₁ ⁽²⁾=1 and that R₁ ⁽¹⁾ and R₂ ⁽²⁾ are unknown. We put $\varphi\overset{df}{=}{R_{0}^{(1)} = {{1\bigwedge R_{2}^{(1)}} = {{2\bigwedge R_{0}^{(2)}} = {{1{\frac{1}{2}\bigwedge R_{1}^{(2)}}} = 1.}}}}$

φ expresses what is known about the rate values.

We now determine the runs ξ and the unknown rate changes θ.

We have two runs:

Δ_(0,2) ⁽¹⁾=Δ₁ ⁽¹⁾+Δ₂ ⁽¹⁾=ln( 2/1)=ln(2)

and Δ_(l) ⁽²⁾=1−1½=−½.

So we take ${\xi\overset{df}{=}\begin{pmatrix} {\Delta_{1}^{(1)} + \Delta_{2}^{(1)}} \\ \Delta_{1}^{(2)} \end{pmatrix}},$ so that ξ₁=Δ₁ ⁽¹⁾+Δ₂ ⁽¹⁾ and ξ₂=Δ₁ ⁽²⁾, and we will apply the conditioning ξ=x where $x\overset{df}{=}{\begin{pmatrix} {\ln(2)} \\ {- \frac{1}{2}} \end{pmatrix} = {\begin{pmatrix} 0.693147 \\ {- \frac{1}{2}} \end{pmatrix}.}}$ The condition ξ=x expresses the fact that the known rate changes take their known values.

We have $M\overset{df}{=}{{\dim(\xi)} = 2.}$

We ${{{put}\quad\Delta}\overset{df}{=}\begin{pmatrix} \Delta_{1}^{(1)} & \Delta_{1}^{(2)} \\ \Delta_{2}^{(1)} & \Delta_{2}^{(2)} \end{pmatrix}},$ the matrix of rate changes over time intervals determined by successive points of time. Then ${\Delta = \begin{pmatrix} * & {- \frac{1}{2}} \\ * & * \end{pmatrix}},$ because Δ₁ ⁽²⁾=−½ and Δ₁ ⁽¹⁾, Δ₂ ⁽¹⁾ and Δ₂ ⁽²⁾ are unknown. Note that Δ does not contain information about runs of length ≧2. We also put ${\theta\overset{df}{=}\begin{pmatrix} \Delta_{1}^{(1)} \\ \Delta_{2}^{(1)} \\ \Delta_{2}^{(2)} \end{pmatrix}},$ the vector of unknown rate changes over time intervals determined by successive points in time. Then θ₁=Δ₁ ⁽¹⁾, θ₂=Δ₂ ⁽¹⁾ and θ₃=Δ₂ ⁽²⁾.

Let us calculate cov(ξ,ξ).

We have $\begin{matrix} {{{cov}\left( {\xi_{1},\xi_{1}} \right)} = {{cov}\left( {{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}},{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}}} \right)}} \\ {= {{\Delta\quad t_{1}\sigma_{1}^{2}} + {\Delta\quad t_{2}\sigma_{1}^{2}\quad\left( {\Delta_{1}^{(1)}{and}{\quad\quad}\Delta_{2}^{(1)}{are}\quad{independent}} \right)}}} \\ {{= \frac{1}{2}},} \end{matrix}$ $\begin{matrix} {{{cov}\left( {\xi_{1},\xi_{2}} \right)} = {{cov}\left( {{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}},\Delta_{1}^{(2)}} \right)}} \\ {= {{{cov}\left( {\Delta_{1}^{(1)},\Delta_{1}^{(2)}} \right)}\quad\left( {\Delta_{2}^{(1)}{and}{\quad\quad}\Delta_{1}^{(2)}{are}\quad{independent}} \right)}} \\ {= {\Delta\quad t_{1}\kappa_{1,2}}} \\ {{= \frac{1}{4}},} \end{matrix}$ and $\begin{matrix} {{{cov}\left( {\xi_{2},\xi_{2}} \right)} = {{cov}\left( {\Delta_{1}^{(2)},\Delta_{1}^{(2)}} \right)}} \\ {= {\Delta\quad t_{1}\sigma_{2}^{2}}} \\ {{= 1},} \end{matrix}$ so that ${{cov}\left( {\xi,\xi} \right)} = {\begin{pmatrix} \frac{1}{2} & \frac{1}{4} \\ \frac{1}{4} & 1 \end{pmatrix}.}$

Let us now decompose cov(ξ,ξ).

If we take ${b_{1}\overset{df}{=}\begin{pmatrix} 0.382683 \\ 0.923880 \end{pmatrix}},{b_{2}\overset{df}{=}\begin{pmatrix} 0.923880 \\ {- 0.382683} \end{pmatrix}},{\lambda_{1}\overset{df}{=}1.103553}$ and ${\lambda_{2}\overset{df}{=}0.396447},$ then {b₁,b₂} is an orthonormal basis of eigenvectors of cov(ξ,ξ) with corresponding eigenvalues λ₁,λ₂ satisfying λ₁≧λ₂>0, so that $r\overset{df}{=}{{{rank}\quad\left( {{cov}\left( {\xi,\xi} \right)} \right)} = 2.}$

Note that we are not showing the working for this decomposition of cov(ξ,ξ): standard techniques exist for computing an orthonormal basis of eigenvectors of a real symmetric matrix and the associated eigenvalues.

Note that cov(ξ,ξ) is non-singular, so that the assumption of consistency is satisfied.

We now put $B\overset{df}{=}{\left( b_{1} \middle| b_{2} \right) = {\begin{pmatrix} 0.382683 & 0.923880 \\ 0.923880 & {- 0.382683} \end{pmatrix}.}}$

Then ${{cov}\left( {\xi,\xi} \right)}^{\oplus} = {{{B\begin{pmatrix} \frac{1}{\lambda_{1}} & 0 \\ 0 & \frac{1}{\lambda_{2}} \end{pmatrix}}B^{T}} = {\begin{pmatrix} 2.285714 & {- 0.571429} \\ {- 0.571429} & 1.142857 \end{pmatrix}.}}$

We now compute E(θ|ξ=x) and cov(θ,θ|ξ=x).

We have ${{E(\xi)} = {\begin{pmatrix} {{\Delta\quad t_{1}\mu_{1}} + {\Delta\quad t_{2}\mu_{1}}} \\ {\Delta\quad t_{1}\mu_{2}} \end{pmatrix} = \begin{pmatrix} 2 \\ 0 \end{pmatrix}}},{{E(\theta)} = {\begin{pmatrix} {\Delta\quad t_{1}\mu_{1}} \\ {\Delta\quad t_{2}\mu_{1}} \\ {\Delta\quad t_{2}\mu_{2}} \end{pmatrix} = \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}}},\begin{matrix} {{{cov}\left( {\theta,\theta} \right)} = \begin{pmatrix} {{cov}\left( {\Delta_{1}^{(1)},\Delta_{1}^{(1)}} \right)} & {{cov}\left( {\Delta_{1}^{(1)},\Delta_{2}^{(1)}} \right)} & {{cov}\left( {\Delta_{1}^{(1)},\Delta_{2}^{(2)}} \right)} \\ {{cov}\left( {\Delta_{2}^{(1)},\Delta_{1}^{(1)}} \right)} & {{cov}\left( {\Delta_{2}^{(1)},\Delta_{2}^{(1)}} \right)} & {{cov}\left( {\Delta_{2}^{(1)},\Delta_{2}^{(2)}} \right)} \\ {{cov}\left( {\Delta_{2}^{(2)},\Delta_{1}^{(1)}} \right)} & {{cov}\left( {\Delta_{2}^{(2)},\Delta_{2}^{(1)}} \right)} & {{cov}\left( {\Delta_{2}^{(2)},\Delta_{2}^{(2)}} \right)} \end{pmatrix}} \\ {= \begin{pmatrix} {\Delta\quad t_{1}\sigma_{1}^{2}} & 0 & 0 \\ 0 & {\Delta\quad t_{2}\sigma_{1}^{2}} & {\Delta\quad t_{2}\kappa_{1,2}} \\ 0 & {\Delta\quad t_{2}\kappa_{2,1}} & {\Delta\quad t_{2}\sigma_{2}^{2}} \end{pmatrix}} \\ {= \begin{pmatrix} {1/4} & 0 & {1/4} \\ 0 & {1/4} & {1/4} \\ 0 & {1/4} & 1 \end{pmatrix}} \end{matrix}$ and $\begin{matrix} {{{cov}\left( {\theta,\xi} \right)} = \begin{pmatrix} {{cov}\left( {\Delta_{1}^{(1)},{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}}} \right)} & {{cov}\left( {\Delta_{1}^{(1)},\Delta_{1}^{(2)}} \right)} \\ {{cov}\left( {\Delta_{2}^{(1)},{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}}} \right)} & {{cov}\left( {\Delta_{2}^{(1)},\Delta_{1}^{(2)}} \right)} \\ {{cov}\left( {\Delta_{2}^{(2)},{\Delta_{1}^{(1)} + \Delta_{2}^{(1)}}} \right)} & {{cov}\left( {\Delta_{2}^{(2)},\Delta_{1}^{(2)}} \right)} \end{pmatrix}} \\ {= \begin{pmatrix} {\Delta\quad t_{1}\sigma_{1}^{2}} & {\Delta\quad t_{1}\kappa_{1,2}} \\ {\Delta\quad t_{2}\sigma_{1}^{2}} & 0 \\ {\Delta\quad t_{2}\kappa_{2,1}} & 0 \end{pmatrix}} \\ {{= \begin{pmatrix} {1/4} & {1/4} \\ {1/4} & 0 \\ {1/4} & 0 \end{pmatrix}},} \end{matrix}$ so that ${E\left( {\left. \theta \middle| \xi \right. = x} \right)} = {{{E(\theta)} + {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{\oplus}\left( {x - {E(\xi)}} \right)}} = \begin{pmatrix} 0.368492 \\ 0.324656 \\ {- 0.675344} \end{pmatrix}}$ and $\begin{matrix} {{{cov}\left( {\theta,{\left. \theta \middle| \xi \right. = x}} \right)} = {{{cov}\left( {\theta,\theta} \right)} - {{{cov}\left( {\theta,\xi} \right)}{{cov}\left( {\xi,\xi} \right)}^{\oplus}{{cov}\left( {\theta,\xi} \right)}^{T}}}} \\ {= {\begin{pmatrix} 0.107143 & {- 0.107143} & {- 0.107143} \\ {- 0.107143} & 0.107143 & 0.107143 \\ {- 0.107143} & 0.107143 & 0.857143 \end{pmatrix}.}} \end{matrix}$

Note that $\begin{matrix} {{{E\left( {\left. \Delta_{1}^{(1)} \middle| \xi \right. = x} \right)} + {E\left( {\left. \Delta_{2}^{(1)} \middle| \xi \right. = x} \right)}} = {{E\left( {\left. \theta_{1} \middle| \xi \right. = x} \right)} + {E\left( {\left. \theta_{2} \middle| \xi \right. = x} \right)}}} \\ {= {0.368492 + 0.324656}} \\ {= {0.6931487\quad\left( {{correcting}\quad{for}\quad{the}} \right.}} \\ \left. {{round}\text{-}{off}\quad{error}} \right) \\ {= {\ln(2)}} \\ {= \Delta_{0,2}^{(1)}} \\ {= {E\left( {\left. \Delta_{0,2}^{(1)} \middle| \xi \right. = x} \right)}} \\ {= {{E\left( {\left. {\Delta_{1}^{(1)} + \Delta_{2}^{(1)}} \middle| \xi \right. = x} \right)}.}} \end{matrix}$ Distribution of Rate Changes

Let us just compute the bivariate conditional distribution of $\begin{pmatrix} \Delta_{1}^{(1)} \\ \Delta_{2}^{(2)} \end{pmatrix}.$ $\begin{pmatrix} \Delta_{1}^{(1)} \\ \Delta_{2}^{(2)} \end{pmatrix}.$ , conditional on ξ=x, ${\sim{N\left( {\begin{pmatrix} {E\left( {\left. \Delta_{1}^{(1)} \middle| \xi \right. = x} \right)} \\ {E\left( {\left. \Delta_{2}^{(2)} \middle| \xi \right. = x} \right)} \end{pmatrix},\begin{pmatrix} {{cov}\left( {\Delta_{1}^{(1)},{\left. \Delta_{1}^{(1)} \middle| \xi \right. = x}} \right)} & {{cov}\left( {\Delta_{1}^{(1)},{\left. \Delta_{2}^{(2)} \middle| \xi \right. = x}} \right)} \\ {{cov}\left( {\Delta_{2}^{(2)},{\left. \Delta_{1}^{(1)} \middle| \xi \right. = x}} \right)} & {{cov}\left( {\Delta_{2}^{(2)},{\left. \Delta_{2}^{(2)} \middle| \xi \right. = x}} \right)} \end{pmatrix}} \right)}} = {{N\left( {\begin{pmatrix} {E\left( {\left. \theta_{1} \middle| \xi \right. = x} \right)} \\ {E\left( {\left. \theta_{3} \middle| \xi \right. = x} \right)} \end{pmatrix},\begin{pmatrix} {{cov}\left( {\theta_{1},{{\theta_{1}❘\xi} = x}} \right)} & {{cov}\left( {\theta_{1},{\left. \theta_{3} \middle| \xi \right. = x}} \right)} \\ {{cov}\left( {\theta_{3},{\left. \theta_{1} \middle| \xi \right. = x}} \right)} & {{cov}\left( {\theta_{3},{\left. \theta_{3} \middle| \xi \right. = x}} \right)} \end{pmatrix}} \right)} = {{N\left( {\begin{pmatrix} 0.368492 \\ {- 0.675344} \end{pmatrix},\begin{pmatrix} 0.107143 & {- 0.107143} \\ {- 0.107143} & 0.857143 \end{pmatrix}} \right)}.}}$

We can also compute the conditional correlation coefficient of Δ₁ ⁽¹⁾ and Δ₂ ⁽²⁾: $\begin{matrix} {{\rho\left( {\Delta_{1}^{(1)},{\left. \Delta_{2}^{(2)} \middle| \xi \right. = x}} \right)} = \frac{{cov}\left( {\Delta_{1}^{(1)},{\left. \Delta_{2}^{(2)} \middle| \xi \right. = x}} \right)}{\sqrt{{var}\left( {\left. \Delta_{1}^{(1)} \middle| \xi \right. = x} \right)}\sqrt{{var}\left( {\left. \Delta_{2}^{(2)} \middle| \xi \right. = x} \right)}}} \\ {= \frac{- 0.107143}{\sqrt{0.107143}\sqrt{0.857143}}} \\ {= {- {0.353554.}}} \end{matrix}$

This is a non-zero correlation across the two rate series and across the two time intervals. Note that the Brownian Motion assumption implies that the unconditional correlation coefficient, ρ(Δ₁ ⁽¹⁾,Δ₂ ⁽²⁾), is zero.

Marginal Rate Distributions

The unknown rates are R₁ ⁽¹⁾ and R₂ ⁽²⁾.

We can use a backward calculation for R₁ ⁽¹⁾ since R₂ ⁽¹⁾ is known.

Now R⁽¹⁾ is a GBM.

Then ln(R₁ ⁽¹⁾), conditional on φ,  ∼ N(ln (R₂⁽¹⁾) − E(Δ_(1, 2)⁽¹⁾|ξ = x), var(Δ_(1, 2)⁽¹⁾|ξ = x)) = N(ln (2) − E(Δ₂⁽¹⁾|ξ = x), var(Δ₂⁽¹⁾|ξ = x)) = N(ln (2) − E(θ₂|ξ = x), cov(θ₂, θ₂|ξ = x)) = N(0.368492, 0.107143).

Thus ln(R₁ ⁽¹⁾) is normally distributed with an expected value of 0.368492 and a variance of 0.107143.

We must use a forward calculation for R₂ ⁽²⁾ because R₁ ⁽²⁾ is the only known rate for R⁽²⁾.

Now R⁽²⁾ is a Brownian Motion.

Then R₂ ⁽²⁾, conditional on φ,  ∼ N(R₁⁽²⁾ + E(Δ_(1, 2)⁽²⁾|ξ = x), var(Δ_(1, 2)⁽²⁾|ξ = x)) = N(1 + E(θ₃|ξ = x), cov(θ₃, θ₃|ξ = x)) = N(0.324656, 0.857143).

Thus R₂ ⁽²⁾ is normally distributed with an expected value of 0.324656 and a variance of 0.857143.

Filling the Unknown Rates

Method 1: Expected Rate Changes

The filled value of R₁ ⁽¹⁾ is: $\begin{matrix} {{\overset{\sim}{R}}_{1}^{(1)} = {R_{2}^{(1)}{\exp\left( {- {E\left( {\left. \Delta_{1,2}^{(1)} \middle| \xi \right. = x} \right)}} \right)}}} \\ {= {2{\exp\left( {- {E\left( {\left. \theta_{2} \middle| \xi \right. = x} \right)}} \right)}}} \\ {= {2{\exp\left( {- 0.324656} \right)}}} \\ {= {1.445553.}} \end{matrix}$

The filled value of R₂ ⁽²⁾ is $\begin{matrix} {{\overset{\sim}{R}}_{2}^{(2)} = {R_{1}^{(2)} + {E\text{(}\Delta_{1,2}^{(2)}\left. {\xi = x} \right)}}} \\ {= {1 + {E\text{(}\theta_{3}\left. {\xi = x} \right)}}} \\ {= {1 - 0.647344}} \\ {= {0.324656.}} \end{matrix}$ Method 2: Expected Rates

The filled value of R₁ ⁽¹⁾ is: $\begin{matrix} {{\overset{\sim}{R}}_{1}^{(1)} = {E\text{(}R_{1}^{(1)}\left. \varphi \right)}} \\ {= {R_{2}^{(1)}\exp\quad\left( {- {E\left( {{{\Delta_{1,2}^{(1)}\left. {\xi = x} \right)} + {\frac{1}{2}{var}\quad\left( \Delta_{1,2}^{(1)} \right.\quad\xi}} = x} \right)}} \right)}} \\ {= {2\quad\exp\quad\left( {- {E\left( {{{\theta_{2}\left. {\xi = x} \right)} + {\frac{1}{2}\quad{cov}\quad\left( {\theta_{2},\theta_{2}}\quad  \right.\quad\xi}} = x} \right)}} \right)}} \\ {= {2\quad\exp\quad\left( {{- 0.324656} + {\frac{1}{2}0.107143}} \right)}} \\ {= {1.525105.}} \end{matrix}$

The filled value of R₂ ⁽²⁾ is: $\begin{matrix} {{\overset{\sim}{R}}_{2}^{(2)} = {E\text{(}R_{2}^{(2)}\left. \varphi \right)}} \\ {= {R_{1}^{(2)} + {E\text{(}\Delta_{1,2}^{(2)}\left. {\xi = x} \right)}}} \\ {= {0.324656.}} \end{matrix}$ Method 3: Simulated Rates

We first decompose cov(θ,θ|ξ=x).

If we take ${s_{1} = \begin{pmatrix} {- 0.154488} \\ 0.154488 \\ 0.975892 \end{pmatrix}},{s_{2} = \begin{pmatrix} {- 0.690024} \\ 0.690024 \\ {- 0.218479} \end{pmatrix}},{s_{3} = \begin{pmatrix} 0.707107 \\ 0.707107 \\ 0 \end{pmatrix}},{\mu_{1} = 0.891067},{\mu_{2} = {{0.180362\quad{and}\quad\mu_{3}} = 0}},$ then {s₁,s₂,s₃} is an orthonormal basis of eigenvectors of cov(θ,θ|ξ=x) with corresponding eigenvalues μ₁, μ₂, μ₃ and μ₁≧μ₂>μ₃=0.

Then $t\overset{df}{=}{{{rank}\quad\left( {{cov}\left( {\theta,{{\theta\text{❘}\xi} = x}} \right)} \right)} = 2.}$

Put $S^{df} = {\left( {s_{1}{s_{2}}s_{3}} \right) = {\begin{pmatrix} {- 0.154488} & {- 0.690024} & 0.707107 \\ 0.154488 & 0.690024 & 0.707107 \\ 0.975892 & {- 0.218479} & 0 \end{pmatrix}.}}$

Let us just do one simulation.

Let {tilde over (W)}₁=0.065137 and {tilde over (W)}₂=−0.617774 be independent random drawings from N(0,1), the standard normal distribution.

Then take $\overset{\sim}{\theta} = {{{E\text{(}\theta\quad\left. {\xi = x} \right)} + {S\begin{pmatrix} {\sqrt{\mu_{1}}{\overset{\sim}{W}}_{1}} \\ {\sqrt{\mu_{2}}{\overset{\sim}{W}}_{2}} \\ 0 \end{pmatrix}}} = {\begin{pmatrix} 0.540029 \\ 0.153118 \\ {- 0.558022} \end{pmatrix}.}}$

Now take

{tilde over (Δ)}₁ ⁽¹⁾={tilde over (θ)}₁=0.540029,

{tilde over (Δ)}₂ ⁽¹⁾={tilde over (θ)}₂=0.153118 and

{tilde over (Δ)}₂ ⁽²⁾={tilde over (θ)}₃=−0.558022.

Note that {tilde over (Δ)}₁ ⁽¹⁾+{tilde over (Δ)}₂ ⁽¹⁾=ln(2)=Δ_(0,2) ⁽¹⁾=Δ₁ ⁽¹⁾+Δ₂ ⁽¹⁾.

We can then take the simulated value of R₁ ⁽¹⁾ to be: $\begin{matrix} {{\overset{\sim}{R}}_{1}^{(1)} = {R_{2}^{(1)}\exp\quad\left( {- {\overset{\sim}{\Delta}}_{2}^{(1)}} \right)}} \\ {= {2\quad\exp\quad\left( {- {\overset{\sim}{\Delta}}_{2}^{(1)}} \right)}} \\ {= 1.716057} \\ {\left( {= {R_{0}^{(1)}\exp\quad\left( {- {\overset{\sim}{\Delta}}_{1}^{(1)}} \right)}} \right),} \end{matrix}$ and the simulated value of R₂ ⁽²⁾ to be: $\begin{matrix} {{\overset{\sim}{R}}_{2}^{(2)} = {R_{1}^{(2)} + {\overset{\sim}{\Delta}}_{2}^{(2)}}} \\ {= {1 + {\overset{\sim}{\Delta}}_{2}^{(2)}}} \\ {= {0.441978.}} \end{matrix}$ Detecting Extreme Rates

Suppose that we are given (complete or incomplete) rate data together with the unconditional rate dynamics of the rate series concerned. Let K be the set of known rates. For each rate x belonging to K, let us use x to denote the rate considered as a random variable and let [x] denote the known value. Let K₀ be a subset, possibly empty, of K that consists of the known rates whose values are to be accepted without question. We wish to partition K\K₀ into two sets, E and N, such that, for each xεE, [x] is extreme relative to the values of the known rates in K₀∪N, and, for each xεN, [x] is not extreme relative to the values of the known rates in K₀∪N\{x}. The idea is that the values of the extreme rates, that is, those belonging to E, are to be considered potentially spurious.

For simplicity, we will assume that the conditional rate dynamics is Brownian Motion or Geometric Brownian Motion, or a combination of the two.

For simplicity, we will use a two-sided confidence interval, centred on the mean, for x if the rate series to which x belongs is a Brownian Motion (or is normally distributed) and a two-sided confidence interval, centred on the mean, for ln(x) if the rate series to which x belongs is a Geometric Brownian Motion (or is lognormally distributed). Note that other confidence intervals could be used.

Suppose X⊂K and x∉X.

If the rate series to which x belongs is a Brownian Motion (or is normally distributed), let μ(x,X) be the mean of x conditional on the known rates in X (taking their known values), let σ(x,X) be the standard deviation of x conditional on the known rates in X, and put $\begin{matrix} {{\eta\quad\left( {x,X} \right)}\overset{df}{=}{\frac{\lbrack x\rbrack - {\mu\quad\left( {x,X} \right)}}{\sigma\quad\left( {x,X} \right)}}} & {{\sigma\quad\left( {x,X} \right)} > 0} \\ {0} & {{\sigma\quad\left( {x,X} \right)} = {{0\bigwedge\lbrack x\rbrack} = {\mu\quad\left( {x,X} \right)}}} \\ {+ \infty} & {{otherwise}.} \end{matrix}$

If the rate series to which x belongs is a Geometric Brownian Motion (or is lognormally distributed), let μ(x,X) be the mean of ln(x) conditional on the known rates in X, let σ(x,X) be the standard deviation of ln(x) conditional on the known rates in X, and put $\begin{matrix} {{{\eta\quad\left( {x,X} \right)}\overset{df}{=}\frac{{\ln\quad\left( \lbrack x\rbrack \right)} - {\mu\quad\left( {x,X} \right)}}{\sigma\quad\left( {x,X} \right)}}} & {{\sigma\quad\left( {x,X} \right)} > 0} \\ {0} & {{\sigma\quad\left( {x,X} \right)} = {{{0\bigwedge\ln}\quad\left( \lbrack x\rbrack \right)} = {\mu\quad\left( {x,X} \right)}}} \\ {+ \infty} & {{otherwise}.} \end{matrix}$

Note that μ(x,X) and σ(x,X) depend on calculated conditional rate dynamics.

Note also that η(x,X) is the distance, measured in standard deviations, of the known value of x from the conditional mode of x.

Now let pε[0,1] be some nominated confidence level.

We define ${\varphi\left( {x,X,p} \right)}\overset{df}{=}\left\{ {\begin{matrix} {{false}\quad{if}\quad X\quad{contains}\quad{no}\quad{known}\quad{rate}\quad{for}\quad{the}} \\ {{rate}\quad{series}\quad{to}\quad{which}\quad x\quad{belongs}} \\ {{\eta\left( {x,X} \right)} > {{N^{- 1}\left( \frac{p + 1}{2} \right)}\quad{otherwise}}} \end{matrix},} \right.$ “the value of x is extreme relative to the known rates in X”, where N⁻¹( ) is the inverse of the cumulative normal distribution function.

One can use the following algorithm to determine the sets E and N: E

Ø N

K\K₀ repeat { if {x ∈ N\K₀| φ(x,N\{x},p)}≠Ø { // exclude the most extreme rate choose x ∈ N\K₀ such that η(x,N\{x})=sup{η(y,N\{y}) | y ∈ N\K₀} N

N\{x} E

E∪{x} // are some rates now misclassified as extreme? repeat { (for each y ∈ E) (if

φ(y,N,p) { N

N∪{y} E

E\{y} } ) } until E does not change } } until E does not change Note that the sets E and N are not uniquely determined. Modelling Zero Coupon Rate Series as a (Geometric) Brownian Motion

The modelling system 1 allows the modelling of the zero coupon rate curves of several bond issuers at several trading dates given a number of bond trades, where specified zero coupon rate series of the several issuers are assumed to follow a (Geometric) Brownian Motion in several dimensions.

For each issuer, a set of maturity buckets, that is, a set of disjoint intervals covering all maturities of interest, is specified. For each issuer and each maturity bucket, a representative or standard maturity falling in the maturity bucket is specified. For each issuer, a pricing function for bonds of the issuer and a method of interpolation for zero coupon rates of the issuer are specified. For each issuer and each standard maturity, the rate type, that is, the compounding frequency and the notional number of days in a year, of the standard maturity zero coupon rate series of the issuer is specified. These rate types may vary from one standard maturity to another for the same issuer. The standard maturity zero coupon rate series, of the specified rate types, of the several issuers are assumed to follow a Brownian Motion or a Geometric Brownian Motion, or a combination of the two, in several dimensions. This involves, first, specifying, for each standard maturity zero coupon rate series of each issuer, the parametric model type (Brownian Motion or Geometric Brownian Motion), the volatility (standard deviation of the rate changes) per unit interval of time and the mean of the rate changes per unit interval of time, and, second, specifying a correlation coefficient of the rate changes for each pair of standard maturity zero coupon rate series (not necessarily of the same issuer). The unit interval of time relative to which the parameters for the (Geometric) Brownian Motion in several dimensions are expressed can be measured as calendar time or as trading time. The assumption of a (Geometric) Brownian Motion in several dimensions together with its associated parameters can be described as the specification of the unconditional zero coupon rate dynamics.

A number of trading dates, not necessarily uniformly spaced, are specified. For each trading date, zero or more traded bonds are specified. This involves specifying, for each traded bond, the issuer of the bond, the settlement date, the maturity date, the annual coupon rate, the annual coupon frequency and the traded yield whose compounding frequency is taken to be the given annual coupon frequency. Note that a bond that traded on two dates is here treated as two traded bonds because of the two trading dates, the two settlement dates and the two traded yields. It is assumed that, for each issuer and each trading date, the maturities of the traded bonds (of the given issuer) that traded on the given trading date are distinct. The specification of the trading dates and the traded bonds can be described as the specification of the traded bond data.

A standard maturity zero coupon rate series for a given issuer is taken to be “known” at a given trading date if there is a traded bond whose issuer is the given issuer, whose trading date is the given trading date and whose maturity, calculated from the given trading date, falls in the maturity bucket associated with the standard maturity zero coupon rate series. A standard maturity zero coupon rate series for a given issuer is taken to be “unknown” at a given trading date if it is not “known” at the given trading date. It is assumed that each standard maturity zero coupon rate series is “known” at at least one trading date. Note that a standard maturity zero coupon rate series that is “known” at some trading date does not have its value, at the given trading date, known with any certainty. Both the “known” and the “unknown” standard maturity zero coupon rates can be considered to be random.

The modelling method provides a way of estimating both the “known” and the “unknown” standard maturity zero coupon rates, for all issuers, all standard maturities and all trading dates, and depends on both the assumed unconditional zero coupon rate dynamics and the traded bond data. The modelling method employs an iterative technique for estimating the “known” and “unknown” standard maturity zero coupon rates and generates, for each issuer and each trading date, a zero coupon rate curve whose maturity points consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls.

The modelling of zero coupon curves involves the following steps:

Step 1

For each issuer and each trading date for which there is at least one “known” standard maturity zero coupon rate for the given issuer at the given trading date, a zero coupon rate curve is constructed whose maturity points consist of the maturities of the traded bonds whose issuers and trading dates are those associated with the curve. Each zero coupon rate curve is constructed in such a way that pricing the traded bonds, associated with the curve, from the curve is consistent with the traded bond data associated with the curve. The curves are thus calibrated against the traded bond data. The curve construction employs not only the yields of the traded bonds, but also the specified pricing function for bonds of the issuer associated with the curve in question and the specified method of interpolation for zero coupon rates for the same issuer. The constructed curves are calibrated against the traded bond data, but do not incorporate correlation effects (or, more precisely, covariance effects) across issuers and trading dates. The curves are used to provide initial estimates for the “known” standard maturity zero coupon rates, and no interpolation is necessary to calculate these estimates from the curves. This step can be described as calculating initial estimates for the “known” standard maturity zero coupon rates.

Step 2

The “unknown” standard maturity zero coupon rates, for all issuers and all trading dates, are filled using the expected values of the standard maturity zero coupon rate changes conditional on the “known” standard maturity zero coupon rates (for all issuers and all trading dates) taking the current estimates of their values. In an alternative version, the “unknown” standard maturity zero coupon rates, for all issuers and all trading dates, are filled with their expected values conditional on the “known” standard maturity zero coupon rates (for all issuers and all trading dates) taking the current estimates of their values. The filling relies on the modelling method of aspect one. The filled values then provide estimates of the “unknown” standard maturity zero coupon rates. This step can be described as estimating the “unknown” standard maturity zero coupon rates, given estimates of the “known” standard maturity zero coupon rates.

Step 3

Given the current estimates of the “unknown” standard maturity zero coupon rates, a zero coupon rate curve is constructed for each issuer and for each trading date. The maturity points of each curve consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls. These curves are constructed in such a way that, first, they are calibrated against the traded bond data and, second, the constructed zero coupon rates corresponding to “unknown” standard maturity zero coupon rates are determined by the given estimates of the “unknown” standard maturity zero coupon rates. The constructed curves provide the next estimates of the “known” standard maturity zero coupon rates, using the specified methods of interpolation, if need be. This step can be described as recalibrating the estimates of the “known” standard maturity zero coupon rates.

Steps 2 and 3 are repeated, as a pair of steps, until the successive estimates of the “known” standard maturity zero coupon rates are equal (or, in practice, until the successive estimates are sufficiently close), that is, until convergence is reached. Note that the repeated execution of steps 2 and 3 allows the progressive incorporation of correlation effects across bond maturities, issuers and trading dates into the estimates of the “known” and “unknown” standard maturity zero coupon rates. When (and if) convergence is reached, the most recent iterates of the curves constructed in step 3 can be taken to be reasonable proxies for the modes of the zero coupon rates conditional on the traded bond data or, in the alternative version, reasonable proxies for the expected values of the zero coupon curves conditional on the traded bond data. The generated zero coupon rate curves have two notable properties. First, the values of the “unknown” standard maturity zero coupon rates determined by the generated zero coupon rate curves are consistent with the expected values of the standard maturity zero coupon rate changes conditional on the “known” standard maturity zero coupon rates taking values determined by the generated curves, or, in the alternative version, the values of the “unknown” standard maturity zero coupon rates determined by the generated curves are the expected values of the “unknown” standard maturity zero coupon rates conditional on the “known” standard maturity zero coupon rate taking values determined by the generated curves. This means that correlation effects across issuers, maturities and trading dates have been incorporated into the generated curves. Second, the generated curves are calibrated against the traded bond data. The two properties together justify taking the generated zero coupon rate curves to be reasonable proxies for the modes of the zero coupon rates conditional on the traded bond data or, in the alternative version, reasonable proxies for the expected values of the zero coupon curves conditional on the traded bond data.

The generated curves enable the pricing, at any of the specified trading dates, of bonds (of the several issuers) other than the specified traded bonds. Thus one can estimate the values of portfolios of bonds of the several issuers at the specified trading dates in a manner consistent with the traded bond data. Such estimated portfolio values incorporate correlation effects across the trading dates, as well as across maturities and across issuers. Note that it is possible to include specified trading dates on which no specified traded bonds of any issuer traded. An example might be a future trading date.

A further two steps allow the approximate simulation of the zero coupon rate curves and of the “known” and “unknown” standard maturity zero coupon rates. The idea behind these two steps is that the values of the “known” standard maturity zero coupon rates are largely determined by the traded bond data and the conditional variation is largely concentrated in the “unknown” standard maturity zero coupon rates.

Step 4

The “unknown” standard maturity zero coupon rates are filled using simulated values conditional on the “known” standard maturity zero coupon rates taking values that result from convergence after the repeated execution of steps 2 and 3, where the alternative version of step 2 is not used. This manner of filling relies on the modelling method of aspect one. This step can be described as simulating the “unknown” standard maturity zero coupon rates.

Step 5

Given the simulated values of the “unknown” standard maturity zero coupon rates provided by step 4, a zero coupon rate curve is constructed for each issuer and for each trading date. The maturity points of each curve consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls. The curves are constructed in such a way that, first, they are calibrated against the traded bond data and, second, the constructed zero coupon rates corresponding to the “unknown” standard maturity zero coupon rates are determined by the simulated values provided by step 4. The constructed curves are simulated and are correlated in a manner consistent with both the assumed unconditional zero coupon rate dynamics and the traded bond data. Simulated values of the “known” standard maturity zero coupon rates can be derived from the simulated curves, using the specified methods of interpolation, if need be. This step can be described as simulating the “known” standard maturity zero coupon rates.

Steps 4 and 5 are repeated, as a pair of steps, to provide as many simulations of the calibrated zero coupon rate curves and of the associated “known” and “unknown” standard maturity zero coupon rates as is desired. These simulations are conditional on the traded bond data.

The simulated curves enable the pricing, at any of the specified trading dates, of bonds (of the several issuers) other than the specified traded bonds. Thus one can simulate the values of portfolios of bonds of the several issuers at the specified trading dates in a manner consistent with the traded bond data. Such simulations incorporate correlation effects across the trading dates, as well as across maturities and across issuers.

Modelling Zero Coupon Rate Spread Series as a (Geometric) Brownian Motion

The modelling system 1 allows the modelling of the zero coupon rate curves of several bond issuers at several trading dates given a number of bond trades, where specified zero coupon rate spread series of the several issuers are assumed to follow a (Geometric) Brownian Motion in several dimensions.

For each issuer, a set of maturity buckets is specified. It is assumed that the number of maturity buckets is the same for all issuers. For each issuer and each maturity bucket, a representative or standard maturity falling in the maturity bucket is specified.

The maturity buckets for each issuer are ordered in ascending order of the associated standard maturities. This ordering is used to set up a correspondence between the maturity buckets of any given issuer and those of any other issuer. The standard maturities for any given issuer would normally be chosen to be equal to the corresponding standard maturities for the other issuers.

For each issuer, a pricing function for bonds of the issuer and a method of interpolation for zero coupon rates of the issuer are specified. For each issuer and each standard maturity, the rate type, that is, the compounding frequency and the notional number of days in a year, of the standard maturity zero coupon rate series of the issuer is specified.

It is assumed that one of the issuers, the base issuer, is, at all times, of a strictly higher credit quality than the other issuers.

The standard maturity zero coupon rate spread series can be specified in one of two ways. Firstly, the standard maturity zero coupon rate spread series for the base issuer are the standard maturity zero coupon rate series for the base issuer (one for each maturity bucket of the base issuer). For each of the remaining issuers and for each maturity bucket of the given issuer, there is a standard maturity zero coupon rate spread series defined to be the difference between the standard maturity zero coupon rate series associated with the given issuer and the given maturity bucket and the standard maturity zero coupon rate series associated with the base issuer and the maturity bucket, of the base issuer, that corresponds with the given maturity bucket. In this case, the specified standard maturity zero coupon rate spread series can be described as series of spreads over the base issuer.

Secondly, it is assumed that the issuers are ordered in strictly descending order of credit quality, so that the base issuer is the first issuer. The standard maturity zero coupon rate spread series for the base issuer are the standard maturity zero coupon rate series for the base issuer (one for each maturity bucket of the base issuer). For each of the remaining issuers and for each maturity bucket of the given issuer, there is a standard maturity zero coupon rate spread series defined to be the difference between the standard maturity zero coupon rate series associated with the given issuer and the given maturity bucket and the standard maturity zero coupon rate series associated with the previous issuer and the maturity bucket, of the previous issuer, that corresponds with the given maturity bucket. In this case, the specified standard maturity zero coupon rate spread series can be described as series of successive spreads.

We can refer to the standard maturity zero coupon rate spread series as spread series.

The spread series of the several issuers are assumed to follow a (Geometric) Brownian Motion in several dimensions. This involves, first, specifying, for each spread series of each issuer, the parametric model type (Geometric Brownian Motion or Brownian Motion), the volatility (standard deviation of the spread changes) per unit interval of time and the mean of the spread changes per unit interval of time, and, second, specifying a correlation coefficient of the spread changes for each pair of spread series. The unit interval of time relative to which the parameters for the (Geometric) Brownian Motion in several dimensions are expressed can be measured as calendar time or as trading time. The assumption of a (Geometric) Brownian Motion in several dimensions together with its associated parameters can be described as the specification of the unconditional spread dynamics.

We will make the assumption that each spread series follows a Geometric Brownian Motion. This assumption ensures that spreads are positive. In the case of spreads over the base issuer, positive spreads reflect the assumption that the base issuer is, at all times, the issuer of highest credit quality. In Australia, the base issuer could be taken to be the Commonwealth of Australia. In the case of successive spreads, positive spreads reflect the assumption that the issuers are, at all times, strictly ordered by credit quality. Here, the term issuer can be interpreted to mean issuer class, for example, AAA or AA+, as defined by a ratings agency. Such issuer classes have a defined unchanging ordering by credit quality, whereas the relative credit quality of individual issuers can change over time.

A number of trading dates, not necessarily uniformly spaced, are specified. For each trading date, zero or more traded bonds are specified. This involves specifying, for each traded bond, the issuer of the bond, the settlement date, the maturity date, the annual coupon rate, the annual coupon frequency and the traded yield whose compounding frequency is taken to be the given annual coupon frequency. Note that a bond that traded on two dates is here treated as two traded bonds because of the two trading dates, the two settlement dates and the two traded yields. It is assumed that, for each issuer and each trading date, the maturities of the traded bonds, of the given issuer, that traded on the given trading date are distinct. The specification of the trading dates and the traded bonds can be described as the specification of the traded bond data.

A standard maturity zero coupon rate series for a given issuer is taken to be “known” at a given trading date if there is a traded bond whose issuer is the given issuer, whose trading date is the given trading date and whose maturity, calculated from the given trading date, falls in the maturity bucket associated with the standard maturity zero coupon rate series. A standard maturity zero coupon rate series for a given issuer is taken to be “unknown” at a given trading date if it is not “known” at the given trading date. These definitions of “known” and “unknown” standard maturity zero coupon rate series induce natural definitions of “known” and “unknown” spread series, spreads and spread changes. It is assumed that each spread series is “known” at at least one trading date. A spread series that is “known” at some trading date does not have its value, at the given trading date, known with any certainty. Both the “known” and the “unknown” spreads, as well as the “known” and the “unknown” standard maturity zero coupon rate series, can be considered to be random.

The modelling method provides a way of estimating both the “known” and the “unknown” standard maturity zero coupon rates (for all issuers, all standard maturities and all trading dates) and depends on both the assumed unconditional spread dynamics and the traded bond data. The modelling method employs an iterative technique for estimating the “known” and “unknown” standard maturity zero coupon rates and generates, for each issuer and each trading date, a zero coupon rate curve whose maturity points consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls.

The modelling method involves the following steps:

Step 1

For each issuer and each trading date for which there is at least one “known” standard maturity zero coupon rate for the given issuer at the given trading date, a zero coupon rate curve is constructed whose maturity points consist of the maturities of the traded bonds whose issuers and trading dates are those associated with the curve. Each zero coupon rate curve is constructed in such a way that pricing the traded bonds, associated with the curve, from the curve is consistent with the traded bond data associated with the curve. The curves are thus calibrated against the traded bond data. The curve construction employs not only the yields of the traded bonds, but also the specified pricing function for bonds of the issuer associated with the curve in question and the specified method of interpolation for zero coupon rates for the same issuer. The constructed curves are calibrated against the traded bond data, but do not incorporate correlation effects across issuers and across trading dates. The curves are used to provide initial estimates for the “known” standard maturity zero coupon rates, and no interpolation is necessary to calculate these estimates from the curves. This step can be described as calculating initial estimates for the “known” standard maturity zero coupon rates.

Step 2

The current estimates of the values of the “known” standard maturity zero coupon rates induce current estimates of the values of the “known” spreads. One cannot simply fill the “unknown” spreads using the expected values of the spread changes conditional on the “known” spreads taking the current estimates of their values because passing from the current estimates of the values of the “known” standard maturity zero coupon rates to the induced current estimates of the values of the “known” spreads involves loss of information. This loss of information can be repaired by adding a set of constraints that relate the “unknown” spreads to the current estimates of the “known” standard maturity zero coupon rates. Each such constraint is linear in the “unknown” spreads. These constraints are, on the face of it, intractable because the assumed unconditional spread dynamics is expressed in terms of spread changes and not in terms of spreads. But the assumed unconditional spread dynamics and the assumption that each spread is “known” at at least one trading date enable the linear constraints to be transformed into non-linear constraints on the “unknown” spread changes. Each of these constraints can be expressed as an equation where the left hand side is a differentiable function of several “unknown” spread changes and the right hand side is a constant that depends on the current estimates of the “known” standard maturity zero coupon rates. Now the problem is the non-linearity of the left hand sides of these constraint equations. The differentiability of the left hand sides enables affine approximations of the left hand sides to be calculated, given some estimate of the “unknown” spread changes. Assuming some estimate of the “unknown” spread changes, one can fill the “unknown” spreads using the expected values of the spread changes conditional both on the “known” spreads taking the current estimates of their values and on the linearised constraint equations being satisfied, where affine approximations of the left hand sides are used. These filled “unknown” spreads are not, in general, consistent with the current estimates of the “known” standard maturity zero coupon rates. But the filled “unknown” spreads, combined with the current induced estimates of the values of the “known” spreads, can provide new estimates of the “unknown” spread changes that, in turn, can provide improved affine approximations of the left hand sides of the constraint equations. An iterative process is used to refine continuously the affine approximations until successive estimates of the filled “unknown” spreads are equal, that is, until convergence is reached. One can prove that, when convergence is reached, the filled “unknown” spreads are necessarily consistent with the current estimates of the “known” standard maturity zero coupon rates. In particular, if the filled “unknown” spreads are taken as the values of the “unknown” spreads, then the linear constraints on the “unknown” spreads that were discussed earlier are satisfied exactly. One can then use the filled “unknown” spreads and the current estimates of the “known” standard maturity zero coupon rates to derive the next estimates of the “unknown” standard maturity zero coupon rates. This step can be described as estimating the “unknown” standard maturity zero coupon rates, given estimates of the “known” standard maturity zero coupon rates.

Step 3

Given the current estimates of the “unknown” standard maturity zero-coupon rates, a zero coupon rate curve is constructed for each issuer and trading date. The maturity points of each curve consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls. These curves are constructed in such a way that, first, they are calibrated against the traded bond data and, second, the constructed zero coupon rates corresponding to “unknown” standard maturity zero coupon rates are determined by the given estimates of the “unknown” standard maturity zero coupon rates. The constructed curves provide the next estimates of the “known” standard maturity zero coupon rates, using the specified methods of interpolation, if need be. This step can be described as recalibrating the estimates of the “known” standard maturity zero coupon rates.

Steps 2 and 3 are repeated, as a pair of steps, until the successive estimates of the “known” standard maturity zero coupon rates are equal, that is, until convergence is reached. Note that the repeated execution of steps 2 and 3 allows the progressive incorporation of correlation effects across bond maturities, issuers and trading dates into the estimates of the “known” and “unknown” standard maturity zero coupon rates. When convergence is reached, the most recent iterates of the curves constructed in step 3 can be taken to be reasonable proxies for the modes of the zero coupon rates conditional on the traded bond data. The generated zero coupon rate curves have two notable properties. First, the values of the “unknown” standard maturity zero coupon rates determined by the generated zero coupon rate curves are consistent with the expected values of the spread changes conditional on the “known” spreads taking values determined by the generated zero coupon rate curves, where the calculation of the expected values is understood to rely on the affine approximations that result from step 2. This means that correlation effects across issuers, maturities and trading dates have been incorporated into the generated curves. Second, the generated curves are calibrated-against the traded bond data. The two properties together justify taking the generated zero coupon rate curves to be reasonable proxies for the modes of the zero coupon curves rates conditional on the traded bond data.

The generated curves enable the pricing, at any of the specified trading dates, of bonds (of the several issuers) other than the specified traded bonds. Thus one can estimate the values of portfolios of bonds of the several issuers at the specified trading dates in a manner consistent with the traded bond data. Such estimated portfolio values incorporate correlation effects across the trading dates, as well as across maturities and issuers. Note that it is possible to include specified trading dates on which no specified traded bonds of any issuer traded. An example might be a future trading date.

A further two steps allow the approximate simulation of the zero coupon rate curves and of the “known” and “unknown” standard maturity zero coupon rates. The idea behind these two steps is that the values of the “known” standard maturity zero coupon rates are largely determined by the traded bond data and the conditional variation is largely concentrated in the “unknown” spreads. Note that the “known” standard maturity zero coupon rates and the “unknown” spreads together determine the “unknown” standard maturity zero coupon rates.

Step 4

The “unknown” spreads are filled using simulated values conditional both on the “known” spreads taking the values that result from convergence after the repeated execution of steps 2 and 3 and on the linearised constraint equations, that also result from convergence, being satisfied. Note that, because of the affine approximations employed, the filled “unknown” spread values are not, in general, quite consistent with the values of the “known” standard maturity zero coupon rates that result from convergence. One can use the values of the “known” standard maturity zero coupon rates and the simulated values of the “unknown” spreads to derive simulated values of the “unknown” standard maturity zero coupon rates. Because of the possible lack of consistency mentioned above, there is some latitude in the method of deriving the simulated values of the “unknown” standard maturity zero coupon rates. This step can be described as simulating the “unknown” standard maturity zero coupon rates.

Step 5

Given the simulated values of the “unknown” standard maturity zero coupon rates provided by step 4, a zero coupon rate curve is constructed for each issuer and each trading date. The maturity points of each curve consist of, first, the maturities of the traded bonds whose issuers and trading dates are those associated with the curve, and, second, the standard maturities for the maturity buckets, for the issuer associated with the curve, in which the maturity of no traded bond, whose issuer and trading date are those associated with the curve, falls. The curves are constructed in such a way that, first, they are calibrated against the traded bond data and, second, the constructed zero coupon rates corresponding to the “unknown” standard maturity zero coupon rates are determined by the simulated values provided by step 4. The constructed curves are simulated and are correlated in a manner consistent with both the assumed unconditional zero coupon rate dynamics and the traded bond data. Simulated values of the “known” standard maturity zero coupon rates can be derived from the simulated curves, using the specified methods of interpolation, if need be. This step can be described as simulating the “known” standard maturity zero coupon rates.

Steps 4 and 5 are repeated, as a pair of steps, to provide as many simulations of the calibrated zero coupon rate curves and of the associated “known” and “unknown” standard maturity zero coupon rates as is desired. These simulations are conditional on the traded bond data.

The simulated curves enable the pricing, at any of the specified trading dates, of bonds (of the several issuers) other than the specified traded bonds. Thus one can simulate the values of portfolios of bonds of the several issuers at the specified trading dates in a manner consistent with the traded bond data. Such simulations incorporate correlation effects across the trading dates, as well as across maturities and issuers.

In the technical material that follows, it is noted that the assumption is made that the multiplication of any undefined term by zero is equal to zero.

Technical Description: Modelling Bond Curves

Let P(y) be the total price of a given bond as a function of the bond's yield-to-maturity, quoted on some trading date. Note that it is possible to use different bond pricing functions for different bond issuers or even for different bonds of a given issuer. By way of example, let us give the following generalisation of the Reserve Bank of Australia's pricing formula for government bonds: ${P(y)}\overset{df}{=}\left\{ \begin{matrix} {d^{f}\left( {{P_{0}d^{n - 1}} + {\frac{FC}{yd}\left( {1 - d^{n}} \right)} - {C\quad\chi_{\{{m \leq {EXDAYS}}\}}}} \right)} & {{{if}\quad n} > 1} \\ \frac{P_{0} + {C\quad\chi_{\{{m > {EXDAYS}}\}}}}{1 + {{ym}/B}} & {{{if}\quad n} = 1} \end{matrix} \right.$ where:

-   -   n is the number of coupon dates remaining after settlement (so         that n−1 whole coupon periods remain unless settlement occurs on         a coupon date),     -   y is the yield-to-maturity, expressed as a decimal,         ${\chi\left\{ \varphi \right\}}\overset{df}{=}\left\{ {\begin{matrix}         1 & {{if}\quad\varphi\quad{is}\quad{true}} \\         0 & {otherwise}         \end{matrix},} \right.$     -    for any boolean expression φ,     -   P₀ is the face value of the bond,     -   F is the annual coupon frequency (a divisor of 12),     -   m is the number of days from settlement to the next coupon date         (after settlement),     -   M is the number of days from the last coupon date on or before         settlement to the next coupon date (after settlement),         ${f\overset{df}{=}{m/M}},{{the}{\quad\quad}{fraction}\quad{of}\quad{the}\quad{current}\quad{coupon}\quad{period}\quad{remaining}},{d\overset{df}{=}{1/\left( {1 + {y/F}} \right)}},{{the}\quad{discount}\quad{factor}\quad{per}\quad{coupon}\quad{period}},{C\overset{df}{=}{P_{0}\quad{{Coupon}/F}}},{{the}\quad{normal}\quad{coupon}\quad{payment}},$     -   Coupon is the coupon rate of the bond, expressed as a decimal,     -   and EXDAYS is the length of the ex coupon period in days.

This formula uses bill pricing if settlement falls in the last coupon period. If settlement does not fall in the last coupon period, we have ${P(y)} = {d^{f}\left( {{P_{0}d^{n - 1}} + {C\left( {\chi_{\{{m > {EXDAYS}}\}} + {\sum\limits_{j = 2}^{n}d^{j - 1}}} \right)}} \right)}$

If we are given a total bond price P, we can calculate a bond's implied yield by solving the equation P(y)=P numerically for y. There is, in general, no analytical method of calculating implied yields.

Let us represent a zero coupon rate curve for a given issuer and a given trading date by C=((s_(j),r_(j)))_(j=1, . . . , n), where n≧0 is the number of maturity points, r_(j) is the continuously compounding zero coupon rate of maturity s_(j) days from the trading date, for each jε{1, . . . , n}, and the maturities are ordered 0<s₁< . . . <s_(n). If n=0, the curve is empty, and we will use the notation C=∅.

Let I represent an interpolation function: for a given maturity τ in days and a given zero coupon rate curve C, I(τ,C) will represent the interpolated continuously compounding zero coupon rate of maturity τ. Note that it is possible to use different interpolation functions for different issuers.

We can price a given bond from a given curve C: ${P(y)} = {{\mathbb{e}}^{{I{({\tau_{0},C})}}{\tau_{0}/B}}{\sum\limits_{j = 1}^{v}{{\mathbb{e}}^{{- {I{({\tau_{j},C})}}}{\tau_{j}/B}}X_{j}}}}$ and solve numerically for the yield-to-maturity y, where

-   -   τ₀≧0 is the maturity in days of the settlement of the bond,     -   B is the notional number of days in a year, and     -   ((τ_(j),X_(j)))_(j=1, . . . , v) is the schedule of remaining         cash-flows of the bond (for each j=1, . . . , v, X_(j) is the         amount paid by the issuer to the bond-holder at the maturity         τ_(j), on the assumption that the bond-holder owns the bond from         settlement until maturity).

Note that the schedule of cash-flows takes account of ex coupon periods. Note also that the notional number of days in a year could here be different from the notional number of days in a year that figures in the bond pricing function.

Now let C=((s_(j),r_(j)))_(j=1, . . . , n) be a curve for some trading date and let y be the known yield of a bond whose maturity is τ days from the given trading date. We suppose that τ>s_(n) if n≧1 and τ>0 if n=0. We now show how to add to C a maturity point corresponding to τ in a way that is consistent with the yield y. For xε

, let C[(τ,x)] be C∪{(τ,x)}. We can solve the equation ${P(y)} = {{\mathbb{e}}^{{I{({\tau_{0},{C{\lbrack{({\tau,x})}\rbrack}}})}}{\tau_{0}/B}}{\sum\limits_{j = 1}^{v}{{\mathbb{e}}^{{- {I{({\tau_{j},{C{\lbrack{({\tau,x})}\rbrack}}})}}}{\tau_{j}/B}}X_{j}}}}$ numerically for x, where, as before, ((τ_(j),X_(j)))_(j=1, . . . , v) is the schedule of cash-flows of the bond and τ₀≧0 is the maturity in days of the bond's settlement which is assumed to be no earlier than the given trading date. Let x=r(y,C) be the solution. Then the bond's yield implied by the curve C∪{(τ,r(y,C))} is y, so that the extended curve C∪{(τ,r(y,C))} is calibrated against the given yield y.

We now suppose that we have K≧1 issuers, indexed by k=1, . . . , K. We can associate, with each issuer k, a bond pricing function P^((k)), a notional number of days in a year B^((k)) and an interpolation function I^((k)). For each issuer k, we suppose that we have a family, (B_(m) ^((k)))_(m=1, . . . , β) _((k)) , of β^((k))≧1 maturity buckets, where, for each mε{1, . . . , β^((k))}, B_(m) ^((k)) is a closed interval [a_(m) ^((k)), b_(m) ^((k))] for some a_(m) ^((k)), b_(m) ^((k))ε

satisfying a₁ ^((k))=1 and a_(m) ^((k))=b_(m−1) ^((k))+1 for mfor each k, we have ${{\underset{m = 1}{\bigcup\limits^{\beta^{(k)}}}\beta_{m}^{(k)}}\bigcap{\mathbb{N}}} = \left\{ {1,\ldots\quad,b_{\beta^{(k)}}^{(k)}} \right\}$ and m(B_(m) ^((k))∪B_(m′) ^((k)))=0 for distinct m,m′ε{1, . . . , β^((k))}. We will assume that, for each k, b_(β) _((k)) ^((k)) is greater than or equal to the longest maturity (in days) of the bonds of issuer k with which we will be concerned.

We assume that we have N+1 trading dates D₀, . . . , D_(N) of interest where N≧0 and D₀< . . . <D_(N). We also assume that we have N+1 associated times t₀ . . . , t_(N). The unit of time for the times t₀, . . . , t_(N) could be one trading day or one calendar day. For each iε{0, . . . , N} and each kε{1, . . . , K}, we suppose that we are given N(k,i)≧0 bonds of issuer k that traded on the date D_(i). For each traded bond, we are given, besides the issuer and the trading date, the settlement, the maturity, the coupon rate, the annual coupon frequency (a divisor of 12) and the traded yield. For each (k,i), we suppose that the N(k,i) bonds have distinct maturities. Let these bonds be indexed by αε{1, . . . , N(k,i)}. Let the maturity (in days) of bond α be τ_(α) ^((k,i)) and let its traded yield be y_(α) ^((k,i)). There is no loss of generality in supposing that 0<τ₁ ^((k,i))< . . . <τ_(N(k,i)) ^((k,i)). We will use the symbol π to represent the traded bond data. Definition ${K\left( {k,i,m} \right)}\overset{df}{=}{1 \leq k \leq {K\bigwedge 0} \leq i \leq {N\bigwedge 1} \leq m \leq {{\beta^{(k)}\bigwedge\left( {\exists\alpha} \right)}\left( {{1 \leq \alpha \leq {{N\left( {k,i} \right)}\bigwedge\tau_{\alpha}^{({k,i})}}} \in \mathcal{B}_{m}^{(k)}} \right)}}$

-   -   “Some bond whose issuer is k and whose maturity fell in bucket m         traded on date i.”

Note that K(k,i,m) depends both on π and on the maturity buckets ((B_(m) ^((k)))_(m=1, . . . , β) _((k)) )_(k=1, . . . , K).

Zero Coupon Rate Series

For each kε{1, . . . , K} and each mε{1, . . . , β^((k))}, we have the zero coupon rate series ${{R^{(k)}(m)}\overset{df}{=}\left( {R_{t}^{(k)}(m)} \right)_{t \in {\mathbb{R}}}},$ where R_(t) ^((k))(m) is the zero coupon rate of issuer k at time t of compounding frequency F_(m) ^((k)) and of maturity M_(m) ^((k)) days, and F_(m) ^((k))ε(0,+∞] and M_(m) ^((k))εB_(m) ^((k)) are assumed to be specified. M_(m) ^((k)) can be called the standard maturity for issuer k and bucket m. We will say that R_(t) _(i) ^((k))(m) is “known” if K(k,i,m) and “unknown” if =K(k,i,m).

We will need the following two conversion functions: $\begin{matrix} {{{FROMCONTINUOUS}\left( {r,F} \right)}\overset{df}{=}{{r\quad\chi_{\{{F = \infty}\}}} + {{F\left( {{\mathbb{e}}^{r/F} - 1} \right)}\chi_{\{{0 < F < \infty}\}}}}} \\ {{{TOCONTINUOUS}\left( {r,F} \right)}\overset{df}{=}{{r\quad\chi_{\{{F = \infty}\}}} + {F\left( {{\ln\left( {1 + {r/F}} \right)}\chi_{\{{0 < F < \infty}\}}} \right.}}} \end{matrix}$ for Fε(0,+∞] and rε

.

If r is a continuously compounding rate, then FROMCONTINUOUS(r,F) is the corresponding rate of compounding frequency F. If r is a rate of compounding frequency F, then TOCONTINUOUS(r,F) is the corresponding continuously compounding rate.

Definition

For a curve C and a maturity τ, let C | τ be the restriction of C to the maturity points≦T.

Calibration Functions

Given kε{1, . . . , K}, iε{0, . . . , N} and π, we can construct a curve C^((k,i))(π): for  k = 1  to  K ${{for}\quad i} = {0\quad{to}\quad{N\left\lbrack \begin{matrix} \left. {C^{({k,i})}(\pi)}\leftarrow\phi \right. \\ {{{for}\quad\alpha} = {1\quad{to}\quad{N\left( {k,i} \right)}}} \\ \left. {C^{({k,i})}(\pi)}\leftarrow{{C^{({k,i})}(\pi)}\left\lbrack \left( {\tau_{\alpha}^{({k,i})},{\tau\left( {y_{\alpha}^{({k,i})},{C^{({k,i})}(\pi)}} \right)}} \right) \right\rbrack} \right. \end{matrix} \right.}}$

Note that, when calculating r(y_(α) ^((k,i)),C^((k,i))(π)), we use I^((k)), B^((k)) and P^((k)). Once the curve construction has been completed, each curve C^((k,i))(π), associated with issuer k and trading date D_(i), has N(k,i) maturity points, and, for each αε{1, . . . , N(k,i)}, the yield of bond α implied by C^((k,i))(π)|τ_(α) ^((k,i)) is the given yield y_(α) ^((k,i)). Thus we may say that the curves (C^((k,i))(π))_((k,i)) are calibrated against the traded bond data π.

We can now interpolate the “known” standard maturity zero coupon rates: ${C(\pi)}\overset{df}{=}{\left( {{FROMCONTINUOUS}\left( {{\mathcal{I}^{(K)}\left( {M_{m}^{(k)},{C^{({k,i})}(\pi)}} \right)},F_{m}^{(k)}} \right)} \right)_{K{({k,i,m})}}.}$

Suppose that X=(X_((k,i,m)))_(K(k,i,m)) is an estimate of the “unknown” standard maturity zero coupon rates and Y=(Y_((k,i,m)))_(K(k,i,m)) is an estimate of the “known” standard maturity zero coupon rates. Then we can form an estimate R(X,Y)=(R_((k,i,m))(X,Y))_((k,i,m)) of all the rates R_(t) _(i) ^((k))(m) by putting ${R_{({k,i,m})}\left( {X,Y} \right)}\overset{df}{=}{{X_{({k,i,m})}\chi_{\{{⫬ {K{({k,i,m})}}}\}}} + {Y_{({k,i,m})}{\chi_{\{{K{({k,i,m})}}\}}.}}}$

We now show how to construct calibrated curves given π and an estimate X of the “unknown” (standard maturity zero coupon) rates: ${{for}\quad k} = {{{1\quad{to}\quad K}{{for}\quad i}} = {0\quad{to}\quad{N\left\lbrack \begin{matrix} \left. {C^{({k,i})}\left( {X,\pi} \right)}\leftarrow\phi \right. \\ {{{for}\quad m} = {1\quad{to}\quad\beta^{(k)}}} \\ \left\lbrack \begin{matrix} {{if}\quad{K\left( {k,i,m} \right)}} \\ \left\lbrack \begin{matrix} {{{for}\quad\alpha} = {1\quad{to}\quad{N\left( {k,i} \right)}}} \\ \left. {C^{({k,i})}\left( {X,\pi} \right)}\leftarrow{{C^{({k,i})}\left( {X,\pi} \right)}\left\lbrack \left( {\tau_{\alpha}^{({k,i})},{r\left( {y_{\alpha}^{({k,i})},{C^{({k,i})}\left( {X,\pi} \right)}} \right)}} \right) \right\rbrack} \right. \end{matrix} \right. \\ {else} \\ \left\lbrack \begin{matrix} \left. {C^{({k,i})}\left( {X,\pi} \right)}\leftarrow \right. \\ {{C^{({k,i})}\left( {X,\pi} \right)}\bigcup\left\{ \left( {M_{m}^{(k)},{{TOCONTINUOUS}\left( {X_{({k,i,m})},F_{m}^{(k)}} \right)}} \right) \right\}} \end{matrix} \right. \end{matrix} \right. \end{matrix} \right.}}}$

Note that each curve C^((k,i))(X,π) has N(k,i)+|{mε{1, . . . , β^((k))}|

K(k,i,m)}| maturity points, and, for αε{1, . . . , N(k,i)}, the yield of bond α implied by C^((k,i))(X,π)|τ_(α) ^((k,i)) is the given yield y_(α) ^((k,i)). Thus the curves ((C^((k,i))(X,π))_(i=0, . . . , N))_(k=1, . . . , K) are calibrated against the traded bond data π.

We also have X=(FROMCONTINUOUS(I ^((k))(M _(m) ^((k)) ,C ^((k,i))(X,π)),F _(m) ^((k)))) _(K(k,i,m)).

We can define a vector of calibrated “known” rates: ${C\left( {X,\pi} \right)}\overset{df}{=}{\left( {{FROMTONTINUOUS}\left( {{\mathcal{I}^{(k)}\left( {M_{m}^{(k)},{C^{({k,i})}\left( {X,\pi} \right)}} \right)},F_{m}^{(k)}} \right)} \right)_{K{({k,i,m})}}.}$

There can be some loss of information in passing from (C^((k,i))(X,π))_((k,i)) to R(X,C(X,π)).

Modelling Zero Coupon Rate Series as (G)BM

We now assume that each R^((k))(m) is specified as either a BM or a GBM.

If we define X^((k))(m)=(X_(t) ^((k))(m))_(tε) by putting ${X_{t}^{(k)}(m)}\overset{df}{=}\left\{ {\begin{matrix} {R_{t}^{(k)}(m)} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{BM}} \\ {\ln\left( {R_{t}^{(k)}(m)} \right)} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{GBM}} \end{matrix},} \right.$ then X^((k))(m) is a BM. We make the stronger assumption that ((X^((k))(m))_(m=1, . . . , β) _((k)) )_(k=1, . . . , K) is a $\sum\limits_{k = 1}^{K}\beta^{(k)}$ -dimensional Brownian Motion. Suppose that the parameters of this Brownian Motion are given. Let μ^((k))(m) be the mean of (the changes in) X^((k))(m) per unit interval of time, for each (k,m), and let ${cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)$ be the calculated covariance of (the changes in) X^((k))(m) and X^((k″))(m′) per unit interval of time.

We assume that each R^((k))(m) is “known” at some t_(i) (or, equivalently, at some D_(i)), that is, (∀kε{1, . . . , K})(∀mε{1, . . . , β^((k))})(∃i)K(k,i,m). Definition V ⁡ ( k , i 1 , i 2 , m ) ⁢ = df ⁢ i 2 > i 1 ⩓ K ⁡ ( k , i 1 , m ) ⩓ K ⁡ ( k , i 2 , m ) ⩓ i 2 - 1 α = i 1 + 1 ⁢ ⫬ K ⁡ ( k , α , m )

This is equivalent to our previous definition of a “run” starting at t_(i) ₁ and ending at t_(i) ₂ if the rates in question are taken to be the zero coupon rates R_(t) _(i) ^((k))(m) and if we suppose that the “known” rates are known. We use the symbol V for vertical on the assumption that the zero coupon rates R_(t) _(i) ^((k))(m) are represented as a matrix with the time dimension appearing vertically. Definitions ${\Delta\left( {R,k,i_{1},i_{2},m} \right)}\overset{df}{=}\left\{ {{\begin{matrix} {{R_{t_{i_{2}}}^{(k)}(m)} - {R_{t_{i_{1}}}^{(k)}(m)}} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{BM}} \\ {\ln\left( {{R_{t_{i_{2}}}^{(k)}(m)}/{R_{t_{i_{1}}}^{(k)}(m)}} \right)} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{GBM}} \end{matrix}\Delta\quad{K\left( {k,i,m} \right)}}\overset{df}{=}{{K\left( {k,i,m} \right)} ⩓ {{K\left( {k,{i - 1},m} \right)}.}}} \right.$

We now put $\xi\overset{df}{=}\left( {\Delta\left( {R,k,i_{1},i_{2},m} \right)} \right)_{V{({k,i_{1},i_{2},m})}}$ $\theta\overset{df}{=}{\left( {\Delta\left( {R,k,{i - 1},i,m} \right)} \right)_{⫬ {\Delta\quad{K{({k,i,m})}}}}.}$

Then the Brownian Motion assumption implies that ${{{E\left( {\Delta\left( {R,k,i_{1},i_{2},m} \right)} \right)} = {\Delta\quad t_{i_{1},i_{2}}{\mu^{(k)}(m)}}},{{{where}\quad\Delta\quad t_{i_{1},i_{2}}}\overset{df}{=}{t_{i_{2}} - t_{i_{1}}}},{and}}\quad$ ${{cov}\quad\left( {{\Delta\left( {R,k,i_{1},i_{2},m} \right)},{\Delta\left( {R,k^{\prime},i_{1}^{\prime},i_{2}^{\prime},m^{\prime}} \right)}} \right)} = {{{cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {i_{1} + 1}}^{i_{2}}\quad{\sum\limits_{l^{\prime} = {i_{1}^{\prime} + 1}}^{i_{2}^{\prime}}\quad{\delta_{l,l^{\prime}}\Delta\quad t_{l}}}}}$

Thus we can calculate E(ξ), E(θ), cov(ξ,ξ), cov(θ,ξ), and cov(θ,θ).

Now we can define x(Y)=(x(Y)_((k,i) ₁ _(,i) ₂ _(,m)))_(V(k,i) ₁ _(,i) ₂ _(,m)), as a function of some given Y=(Y_((k,i,m)))_(K(k,i,m)), by putting ${x(Y)}_{({k,i_{1},i_{2},m})}\overset{df}{=}\left\{ {\begin{matrix} {Y_{({k,i_{2},m})} - Y_{({k,i_{1},m})}} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{BM}} \\ {\ln\left( {Y_{({k,i_{2},m})}/Y_{({k,i_{1},m})}} \right)} & {{if}\quad{R^{(k)}(m)}\quad{is}\quad a\quad{GBM}} \end{matrix}.} \right.$

Then we can calculate E(θ|ξ=x(Y))=E(θ)+cov(θ,ξ)cov(ξ,ξ)^(⊕)(x(Y)−E(ξ)) and cov(θ,θ|ξ=x(Y))=cov(θ,θ)−cov(θ,ξ)cov(ξ,ξ)^(⊕) cov(ξ,θ).

We define the random vectors $x\overset{df}{=}{{\left( {R_{t_{i}}^{(k)}(m)} \right)_{⫬ {K{({k,i,m})}}}\quad{and}\quad y}\overset{df}{=}{\left( {R_{t_{i}}^{(k)}(m)} \right)_{K{({k.i.m})}}.}}$ Now E(x|y=Y) is the vector of expected values of the “unknown” rates R_(t) _(i) ^((k))(m) conditional on y=Y. It can be calculated using E(θ|ξ=x(Y)), cov(θ,θ|ξ=x(Y)) and Y. We have E(x|y=Y)=(E(R _(t) _(i) ^((k))(m)|y=Y))_(K(k,i,m)).

Let us denote by E(x|y=Y) the vector of “unknown” rates R_(t) _(i) ^((k))(m) “backed out” from E(θ|ξ=x(Y)) given y=Y, that is, filling using expected rate changes. Say E (x|y=Y)=( E (R _(t) _(i) ^((k))(m)|y=Y))_(K(k,i,m)).

We have still to solve for Y.

Estimating Expected Zero Coupon Rates

We put ${Y_{0}\overset{df}{=}{{{C(\pi)}\quad{and}\quad X_{0}}\overset{df}{=}{{{{E\left( {{x\text{❘}y} = Y_{0}} \right)}.\quad{For}}\quad n} \geq 1}}},{{{we}\quad{put}\quad Y_{n}}\overset{df}{=}{{{C\left( {X_{n - 1},\pi} \right)}\quad{and}\quad X_{n}}\overset{df}{=}{{E\left( {{x\text{❘}y} = Y_{n}} \right)}.}}}$ We continue calculating until ∥Y_(n)−Y_(n−1)∥_(∞)=0 (or, in practice, until ∥Y_(n)−Y_(n−1)∥_(∞)=0 is sufficiently small). We then put ${X\overset{df}{=}{{{X_{n}\left( {= X_{n - 1}} \right)}\quad{and}{\quad\quad}Y}\overset{df}{=}{Y_{n}\left( {= Y_{n - 1}} \right)}}},$ and get X=E(x|y=Y) and Y=C(X,π). We can take R(X,Y) to be a reasonable proxy for the expectation of (R_(t) _(i) ^((k))(m))_((k,i,m)) conditional on the traded bond data π. Note that correlation effects across maturities, issuers and trading dates have been progressively incorporated into X and Y in the course of the iteration. Estimating the Modes of the Zero Coupon Rates

We put ${Y_{0}\overset{df}{=}{{{C(\pi)}\quad{and}\quad X_{0}}\overset{df}{=}{{{{\underset{\_}{E}\left( {{x\text{❘}y} = Y_{0}} \right)}.\quad{For}}\quad n} \geq 1}}},{{{we}\quad{put}\quad Y_{n}}\overset{df}{=}{{{C\left( {X_{n - 1},\pi} \right)}\quad{and}\quad X_{n}}\overset{df}{=}{{\underset{\_}{E}\left( {{x\text{❘}y} = Y_{n}} \right)}.}}}$ We continue calculating until ∥Y_(n)−Y_(n−1)∥_(∞)=0. We ${{{then}\quad{put}\quad X}\overset{df}{=}{{{X_{n}\left( {= X_{n - 1}} \right)}\quad{and}\quad Y}\overset{df}{=}{Y_{n}\left( {= Y_{n - 1}} \right)}}},$ and get X=E(x|y=Y) and Y=C(X,π). We can take R(X,Y) to be a reasonable proxy for the modes of R_(t) _(i) ^((k))(m), for (k,i,m), conditional on the traded bond data π.

Note that, for both these ways of estimating the zero coupon rates, we can use the curves (C^((k,i))(X,π))_((k,i)) to price non-traded bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N).

Simulating the Zero Coupon Rates

Let X and Y be calculated either as conditional modes or as conditional expectations. Then we have either X=E(x|y=Y) and Y=C(X,π), or X=E(x|y=Y) and Y=C(X,π). We can use E(θ|ξ=x(Y)) and cov(θ,θ|ξ=x(Y)) to calculate a random drawing {tilde over (θ)} of the normal random vector θ. From {tilde over (θ)} and Y, we can derive {tilde over (X)}=({tilde over (X)}_((k,i,m)))_(K(k,i,m)) by filling with simulated values. We can then recalibrate the “known” rates by putting ${\overset{\sim}{Y}\overset{df}{=}{C\left( {\overset{\sim}{X},\pi} \right)}},$ and take R({tilde over (X)},{tilde over (Y)}) to be an approximate random drawing of (R_(t) _(i) ^((k))(m))_((k,i,m)) conditional on the traded bond data π. We can use the simulated curves (C^((k,i))({tilde over (X)},π))_((k,i)) to derive simulated prices of non-traded bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N). Note

The assumption of consistency may not be satisfied if cov(ξ,ξ) is singular. Put $\Gamma\overset{df}{=}{{\left\{ {\left( {k,m} \right)\text{❘}\left( {\exists i_{1}} \right)\left( {\exists i_{2}} \right){V\left( {k,i_{1},i_{2},m} \right)}} \right\}\quad{and}\quad R^{\prime}}\overset{df}{=}{\left( {R^{(k)}(m)} \right)_{{({k,m})} \in \Gamma}.}}$ If the unconditional covariance matrix of R′ per unit interval of time is non-singular, then cov(ξ,ξ) is also non-singular and the assumption of consistency is satisfied. Modelling Spreads over a Base Issuer

We assume that the issuer indexed by k=1, the base issuer, is at all times of a higher credit quality than the other issuers. We assume that the number of maturity buckets is the same for each issuer, so that β^((k))=β^((k′)) for all k,k′ε{1, . . . , K}. The standard maturities would typically be chosen to be the same for each issuer, that is, M_(m) ^((k))=M_(m) ^((k′)) for all mε{1, . . . , β^((k))} and all k,k′ε{1, . . . , K}.

For each kε{1, . . . , K} and each mε{1, . . . , β^((k))}, we define the zero coupon rate spread series, S^((k))(m)=(S_(t) ^((k))(m))_(tε), over the base issuer by putting ${S_{t}^{(k)}(m)}\overset{df}{=}{{R_{t}^{(k)}(m)} = {{R_{t}^{(1)}(m)}{\chi_{\{{k > 1}\}}.}}}$

We assume that ((S^((k))(m))_(m=1, . . . , β) _((k)) )_(k=1, . . . , K) is a $\sum\limits_{k = 1}^{K}\quad\beta^{(k)}$ -dimensional Geometric Brownian Motion, thus ensuring that the spreads are positive. So, if we define ${X^{(k)}(m)}\overset{df}{=}\left( {\ln\left( {S_{t}^{(k)}(m)} \right)} \right)_{{t \in {\mathbb{R}}},}$ we are assuming that ((X^((k))(m))_(m=1, . . . , β) _((k)) )_(k=1, . . . , K) is a $\sum\limits_{k = 1}^{K}\quad\beta^{(k)}$ -dimensional Brownian Motion. We suppose that the parameters of this Brownian Motion are given. Let μ^((k))(m) be the mean of (the changes in) X^((k))(m) per unit interval of time, for each (k,m), and let ${cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)$ be the calculated covariance of (the changes in) X^((k))(m) and X^((k′))(m′) per unit interval of time.

We already have ${K\left( {k,i,m} \right)}\overset{df}{=}{1 \leq k \leq {K\bigwedge 0} \leq i \leq {N\bigwedge 1} \leq m \leq {{\beta^{(k)}\bigwedge\left( {\exists\alpha} \right)}{\left( {{1 \leq \alpha \leq {{N\left( {k,i} \right)}\bigwedge\tau_{\alpha}^{({k,i})}}} \in \mathcal{B}_{m}^{(k)}} \right).}}}$

Let us define ${{K^{*}\left( {k,i,m} \right)}\overset{df}{=}{{K\left( {k,i,m} \right)}\bigwedge\left( {k > 1}\Rightarrow{K\left( {1,i,m} \right)} \right)}},$

“The spread S_(t) _(i) ^((k))(m) is ‘known’.”

We will say that S_(t) _(i) ^((k))(m) is “known” if K*(k,i,m) and “unknown” if

K*(k,i,m).

We assume that each S^((k))(m) is “known” at some t_(i), that is, (∀kε{1, . . . , K})(∀mε{1, . . . , β^((k))})(∃i)K*(k,i,m).

For X=(X_((k,i,m)))_(K(k,i,m)) and Y=(Y_((k,i,m)))_(K(k,i,m)), we can define S(X,Y)=(S_((k,i,m))(X,Y))_((k,i,m)) by putting ${S_{({k,i,m})}\left( {X,Y} \right)}\overset{df}{=}{{R_{({k,i,m})}\left( {X,Y} \right)} - {{R_{({1,i,m})}\left( {X,Y} \right)}{\chi_{\{{k > 1}\}}.}}}$

We then have R(X,Y)=(S _((k,i,m))(X,Y)+S _((1,i,m))(X,Y)χ_({k>1}))_((k,i,m)).

Let us define ${{\varphi_{k}(\alpha)}\overset{df}{=}{\chi_{\{{\alpha = 1}\}} + {k\quad\chi_{\{{\alpha = 2}\}}}}},{{{for}\quad\alpha}\quad \in {\left\{ {1,2} \right\}\quad{and}\quad k} \in {\left\{ {1,\ldots\quad,K} \right\}.}}$

Then, for k>1 and given X and Y, we have ${\sum\limits_{\alpha = 1}^{2}\quad{S_{({{\varphi\quad{\kappa{(\alpha)}}},i,m})}\left( {X,Y} \right)}} = {{R_{({k,i,m})}\left( {X,Y} \right)}.}$

We also have ${\sum\limits_{\alpha = 1}^{2}\quad{S_{t_{i}}^{({\varphi\quad{\kappa{(\alpha)}}})}(m)}} = {R_{t_{i}}^{(k)}(m)}$ for all (k,i,m) such that k>1.

We now define ${{H\left( {k,i,m} \right)}\overset{df}{=}{{K\left( {k,i,m} \right)}\bigwedge{⫬ {K\left( {1,i,m} \right)}}}},$ where H stands for horizontal, so that H ⁡ ( k , i , m ) ⇒ ( k > 1 ⩓ 2 α = 1 ⁢ ⫬ K * ⁡ ( φ ⁢   ⁢ κ ⁡ ( α ) , i , m ) ) .

For Y=(Y_((k,i,m)))_(K(k,i,m)), we define ${{\psi(Y)}\overset{df}{=}\left( {Y_{({k,i,m})} - {Y_{({1,i,m})}\chi_{\{{k > 1}\}}}} \right)_{K^{*}{({k,i,m})}}},$ the “known” spreads implied by the “known” rates. Proposition

For W=(W_((k,i,m)))_((k,i,m)) and Y=(Y_((k,i,m)))_(K(k,i,m)), we have (∃X)(W=S(X,Y))

K * ⁡ ( k , i , m ) ⁢ ( W ( k , i , m ) = ψ ⁡ ( Y ) ( k , i , m ) ) ⩓ H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢   ⁢ W ( φ ⁢   ⁢ κ ⁡ ( α ) ) , i , m ) = Y ( k , i , m ) ) . Proof (

)

Suppose that X=(X_((k,i,m)))_(K(k,i,m)) satisfies W=S(X,Y).

Then, for all (k,i,m), we have $\begin{matrix} {{W_{({k,i,m})} + W_{{({1,i,m})}\chi{\{{k > 1}\}}}} = {S_{{({k,i,m})}{({X,Y})}} + S_{{({1,i,m})}{({X,Y})}\chi{\{{k > 1}\}}}}} \\ {= R_{{({k,i,m})}{({X,Y})}}} \\ {= {X_{{({k,i,m})}\chi{\{{- {K{({k,i,m})}}}\}}} + {Y_{{({k,i,m})}\chi{\{{K{({k,i,m})}}\}}}.}}} \end{matrix}$

Suppose K*(k,i,m).

case k=1

Then W_((k,i,m))=Y_((k,i,m))=ψ(Y)_((k,i,m)).

case k>1

Then K(k,i,m), K(1,i,m) and W_((k,i,m))+W_((1,i,m))=Y_((k,i,m)).

But W_((1,i,m))=Y_((1,i,m)), because K(1,i,m), so that W _((k,i,m)) =Y _((k,i,m)) −Y _((1,i,m))=ψ(Y)_((k,i,m)).

Thus we have shown K * ⁡ ( k , i , m ) ⁢ ( W ( k , i , m ) = ψ ⁢   ⁢ ( Y )   ⁢( k , i , m ) ) .

Now suppose H(k,i,m). Then k>1, K(k,i,m) and

K(1,k,m), and we have ${\sum\limits_{\alpha = 1}^{2}W_{{{({\varphi_{k}{(\alpha)}})},i,m})}} = {{W_{({k,i,m})} + W_{({1,i,m})}} = {{W_{({k,i,m})} + W_{{({1,i,m})}\chi{\{{k > 1}\}}}} = {Y_{({k,i,m})}.}}}$

Thus we have shown H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢ W ( φ k ⁡ ( α ) ) , i , m ) = Y ( k , i , m ) ) . (

)

Now suppose K * ⁡ ( k , i , m ) ⁢ ( W ( k , i , m ) = ψ ⁡ ( Y ) ( k , i , m ) ) ⋀ H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢ W ( φ k ⁡ ( α ) ) , i , m ) = Y ( k , i , m ) ) .

Put $X\overset{df}{=}{\left( {W_{({k,i,m})} + {W_{({1,i,m})}\chi_{\{{k > 1}\}}}} \right)_{⫬ {K{({k,i,m})}}}.}$

We show that W=S(X,Y).

case k=1 and K(k,i,m)

Then $\begin{matrix} {{S_{({k,i,m})}\left( {X,Y} \right)} = {R_{({k,i,m})}\left( {X,Y} \right)}} & {\left( {k = 1} \right)} \\ {= Y_{({k,i,m})}} & {\left( {k = {1\quad{and}\quad{K\left( {k,i,m} \right)}}} \right)} \\ {= {\psi(Y)}_{({k,i,m})}} & {\left( {k = {1\quad{and}\quad{K\left( {k,i,m} \right)}}} \right)} \\ {= W_{({k,i,m})}} & {\left( {K^{*}\left( {k,i,m} \right)} \right).} \end{matrix}$ case k=1 and

K(k,i,m)

Then $\begin{matrix} {{{S_{({k,i,m})}\left( {X,Y} \right)} = {R_{({k,i,m})}\left( {X,Y} \right)}}\quad} & {\left( {k = 1} \right)} \\ {= X_{({k,i,m})}} & {\left( {k = {1\quad{and}\quad{⫬ {K\quad\left( {k,i,m} \right)}}}} \right)} \\ {= W_{({k,i,m})}} & {\left( {k = {1\quad{and}\quad{definition}{\quad\quad}{of}\quad X}} \right).} \end{matrix}$ case k>1 and K(k,i,m) and

K(1,i,m)

Then K*(k,i,m) and S_((k,i,m))(X,Y)=Y_((k,i,m))−Y_((1,i,m))=ψ(Y)_((k,i,m))=W_((k,i,m)).

case k>1 and K(k,i,m) and K(1,i,m)

Then H(k,i,m) and S_((k,i,m))(X,Y)=Y_((k,i,m))−X_((1,i,m))=Y_((k,i,m))−W_((1,i,m)).

But H(k,i,m) implies that W_((1,i,m))+W_((k,i,m))=Y_((k,i,m)), so that S _((k,i,m))(X,Y)=W _((1,i,m)) +W _((k,i,m)) −W _((1,i,m)) =W _((k,i,m)). case k>1 and

K(k,i,m) and K(1,i,m)

Then $\begin{matrix} {{S_{({k,i,m})}\left( {X,Y} \right)} = {X_{({k,i,m})} - Y_{({1,i,m})}}} & \quad \\ {= {W_{({k,i,m})} + W_{({1,i,m})} - {\psi(Y)}_{({1,i,m})}}} & \quad \\ {= {W_{({k,i,m})} + W_{({1,i,m})} - W_{({1,i,m})}}} & {\left( {K^{*}\left( {k,i,m} \right)} \right)} \\ {= {W_{({k,i,m})}.}} & \quad \end{matrix}$ case k>1 and

K(k,i,m) and

K(1,i,m)

Then $\begin{matrix} {{S_{({k,i,m})}\left( {X,Y} \right)} = {X_{({k,i,m})} - X_{({1,i,m})}}} \\ {= {W_{({k,i,m})} + W_{({1,i,m})} - W_{({1,i,m})}}} \\ {= {W_{({k,i,m})}.}} \end{matrix}$

Thus we have S_((k,i,m))(X,Y)=W_((k,i,m)) in all cases, so that S(X,Y)=W.

Note that the proof shows that if (∃X)(W=S(X,Y)), then such an X is unique (because it must be equal to (W_((k,i,m))+W_((1,i,m))χ_({k>1}))_(K(k,i,m))).

Now suppose that H(k,i,m). Then, for α=1,2, we can choose l_(α) ^((k,i,m))ε{0, 1, . . . , N} such that |t_(l) _(α) _((k,i,m)) −t_(i)|=inf{|t_(i′)−t_(i)∥K*(φ_(k)(α),i′,m)} and K*((φ_(k)(α),l_(α) ^(k,i,m)),m). The existence of each l_(α) ^((k,i,m)) follows from the assumption that each S^((k))(m) is “known” at some date. Note that l_(α) ^((k,i,m)) is the time index of the “known” spread of the form S_(t) _(i′) ^((φ) ^(k) ^((α)))(m) that is closest in time to S_(t) _(i) ^((φ) ^(k) ^(k(α)))(m). There may be two choices for l_(α) ^((k,i,m)). Note also that l_(α) ^((k,i,m))≠i because H(k,i,m) implies that

K*(φ_(k)(α),i,m), for α=1,2. We can also define ${s_{\alpha}^{({k,i,m})}\overset{df}{=}{\chi_{\{{l_{\alpha}^{({k,i,m})} < i}\}} - \chi_{\{{l_{\alpha}^{({k,i,m})} > i}\}}}},$ for α=1,2. We will often omit the superscript ( )^((k,i,m)) from l_(α) ^((k,i,m)) and s_(α) ^((k,i,m)). Definitions ${S\overset{df}{=}{{\left( {S_{t_{i}}^{(k)}(m)} \right)_{({k,i,m})}.\quad{\Delta^{*}\left( {W,k,i_{1},i_{2},m} \right)}}\overset{df}{=}{\ln\left( \frac{W\left( {k,i_{2},m} \right)}{W\left( {k,i_{1},m} \right)} \right)}}},{{{for}\quad W} = {\left( W_{({k,i,m})} \right)_{({k,i,m})}.}}$

Then, given H(k,i,m), the Geometric Brownian Motion assumption implies that S_(t) _(i) ^((φ) ^(k) ^((α)))(m)=S_(t) _(α) ^(φ) ^(k) ^((α)))(m) exp(s_(α)Δ*(S, φ_(k)(α), min(i, t_(α)), max(i, t_(α)), m)),

for α=1,2. We will sometimes use the alternative notation S_((k,i,m)) for S_(t) _(i) ^((k))(m).

As before, we define $y\overset{df}{=}{\left( {R_{t_{i}}^{(k)}(m)} \right)_{K{({k,i,m})}}.}$

We also define $y^{*}\overset{df}{=}{\left( {S_{t_{i}}^{(k)}(m)} \right)_{K^{*}{({k,i,m})}}.}$ Note that y=Y implies that y*=ψ(Y). Let us also define V * ⁡ ( k , i 1 , i 2 , m ) ⁢ = df ⁢ i 2 > i 1 ⩓ K * ⁡ ( k , i 1 , m ) ⩓ K * ⁡ ( k , i 2 , m ) ⩓ α = i 1 + 1 i 2 - 1 ⁢ ⫬ K * ⁡ ( k , α , m ) ⁢   ⁢ and ⁢   ⁢ Δ ⁢   ⁢ K * ⁡ ( k , i , m ) ⁢ = df ⁢ K * ⁡ ( k , i , m ) ⩓ K * ⁡ ( k , i - 1 , m ) .

We put $\theta\overset{df}{=}{\left( {\Delta^{*}\left( {S,k,{i - 1},i,m} \right)} \right)_{\Delta\quad{K^{*}{({k,i,m})}}}.}$

Suppose that we are given Y=(Y_((k,i,m)))_(K(k,i,m)), an estimate of the “known” zero coupon rates. First suppose (∀(k,i,m))

H(k,i,m).

We then put ${\xi\overset{df}{=}{\left( {\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)} \right)_{V*}}_{({k,i_{1},i_{2},m})}},{{x(Y)}\overset{df}{=}{\left( {\ln\left( \frac{{\psi(Y)}_{({k,i_{2},m})}}{{\psi(Y)}_{({k,i_{1},m})}} \right)} \right)_{V*{({k,i_{1},i_{2},m})}}.}}$

Then $\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad$ is normal. Now E(Δ*(S,k,i ₁ ,i ₂ ,m))=Δt _(i) ₁ _(,i) ₂ μ^((k))(m), where ${{\Delta\quad t_{i_{1},i_{2}}}\overset{df}{=}{t_{i_{2}} - t_{i_{1}}}},$ and ${{cov}\left( {{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)},{\Delta^{*}\left( {S,k^{\prime},i_{1}^{\prime},i_{2}^{\prime},m^{\prime}} \right)}} \right)} = {{{cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {i_{1} + 1}}^{i_{2}}{\sum\limits_{l^{\prime} = {i_{i}^{\prime} + 1}}^{i_{2}^{\prime}}{\delta_{l,l^{\prime}}\Delta\quad{t_{l}.}}}}}$

Thus we can calculate E(ξ), E(θ), cov(ξ,ξ), cov(θ,ξ) (and cov(θ,θ)), and therefore also E(θ|ξ=x(Y))=E(θ)+cov(θ,ξ)cov(ξ,ξ)^(⊕)(x(Y)−E(ξ)).

Given E(θ|ξ=x(Y)) and assuming y*=ψ(Y), we can fill the spreads, using expected spread changes, to get, say, E (S|ξ=x(Y))=( E (S _(t) _(i) ^((k))(m)|ξ=x(Y)))_((k,i,m)).

But then we have K * ⁡ ( k , i , m ) ⁢ ( E _ ⁢   ⁢ ( S t i ( k ) ⁡ ( m ) ❘ ξ = x ⁢   ⁢ ( Y ) ) = ψ ⁢   ⁢ ( Y ) ( k , i , m ) ) ⁢   ⁢ and ⁢   ⁢ ( ∀ ( k , i , m ) ) ⁢ ⫬ H ⁢   ⁢ ( k , i , m ) , so that E(S|ξ=x(Y))=S(X(Y),Y), where ${X(Y)}\overset{df}{=}{\left( {{\underset{\_}{E}\left( {{{S_{t_{i}}^{(k)}(m)}\text{❘}\xi} = {x(Y)}} \right)} + {{\underset{\_}{E}\left( {{{S_{t_{i}}^{(1)}(m)}\text{❘}\xi} = {x(Y)}} \right)}\chi_{\{{k > 1}\}}}} \right)_{⫬ {K{({k,i,m})}}}.}$

We put ${\xi(Y)}\overset{df}{=}{\xi.}$

Now suppose that (∃(k,i,m))H(k,i,m).

For each (k,i,m) satisfying H(k,i,m), let us define ${\alpha_{\alpha}^{({k,i,m})}(Y)}\overset{df}{=}{\psi(Y)}_{({{{\varphi\quad}_{k}{(\alpha)}},l_{\alpha}^{({k,i,m})},m})}$ for α=1,2, and ${F_{Y}^{({k,i,m})}(Z)}\overset{df}{=}{\sum\limits_{\alpha = 1}^{2}{{a_{\alpha}^{({k,i,m})}(Y)}{\mathbb{e}}^{Z \Cup}}}$ for Z=(Z_(α))_(α=1,2)ε

².

Then, given H(k,i,m) and y=Y (and omitting the superscripts ( )^((k,i,m))), we have ${\sum\limits_{\alpha = 1}^{2}{S_{t_{i}}^{({\varphi_{k}{(\alpha)}})}(m)}} = {{\sum\limits_{a = 1}^{2}{{S_{t_{\iota_{\alpha}}}^{({\varphi_{k}{(\alpha)}})}(m)}{\exp\left( {s_{\alpha}{\Delta^{*}\left( {S,{\varphi_{k}(\alpha)},{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)}}} = {{F_{Y}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,{\varphi_{k}(\alpha)},{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right)}.}}$

But F_(Y)((s_(α)Δ*(S,φ_(k)(α),min(i,l_(α)),max(i,l_(α)),m))_(α=1,2)) is not, in general, normal because F_(Y) is non-linear. Let (f_(Y) ^((k,i,m)))^((Z) ⁽⁰⁾ ⁾, or just f_(Y) ^((Z) ⁽⁰⁾ ₎ , be the affine approximation of F_(Y) at Z⁽⁰⁾=(Z_(α) ⁽⁰⁾)_(α=1,2)ε

². Then, for Z=(Z_(α))_(α=1,2)ε

², we have, again omitting the superscripts ( )^((k,i,m)), ${f_{Y}^{(Z^{(0)})}(Z)} = {{{F_{Y}\left( Z^{(0)} \right)} + {{F_{Y}^{\prime}\left( Z^{(0)} \right)}\left( {Z - Z^{(0)}} \right)}} = {{{\sum\limits_{a = 1}^{2}{{\alpha_{\alpha}(Y)}{\mathbb{e}}^{Z_{\alpha}^{(0)}}}} + {\sum\limits_{a = 1}^{2}{\frac{\partial F}{\partial Z_{\alpha}}\left( Z^{(0)} \right)\left( {Z_{\alpha} - Z_{a}^{(0)}} \right)}}} = {{{\sum\limits_{a = 1}^{2}{{\alpha_{\alpha}(Y)}{\mathbb{e}}^{Z_{\alpha}^{(0)}}}} + {\sum\limits_{a = 1}^{2}{{\alpha_{\alpha}(Y)}{{\mathbb{e}}^{Z_{\alpha}^{(0)}}\left( {Z_{\alpha} - Z_{a}^{(0)}} \right)}}}} = {\sum\limits_{a = 1}^{2}{{\alpha_{\alpha}(Y)}{{{\mathbb{e}}^{Z_{\alpha}^{(0)}}\left( {1 + Z_{\alpha} - Z_{\alpha}^{(0)}} \right)}.}}}}}}$

So, for any Z⁽⁰⁾ε

² (and given H(k,i,m)), f_(Y) ^(Z) ⁽⁰⁾ ⁾(Z) is of the form a+b^(T)Z for some aε

, ${{a \in {{\mathbb{R}}\quad b}} = {\begin{pmatrix} b_{1} \\ b_{2} \end{pmatrix} \in {\mathbb{R}}^{2}}},$ assuming that Z is represented as a column vector. We let x(Y)=(x_(r)(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k,i,m) such that H(k,i,m). If r corresponds to V*(k,i₁,i₂,m), we put ${{x_{r}(Y)}\overset{df}{=}{\ln\left( \frac{{\psi(Y)}_{({k,i_{2},m})}}{{\psi(Y)}_{({k,i_{2},m})}} \right)}},$ and if r corresponds to H(k,i,m), we put ${x_{r}(Y)}\overset{df}{=}{Y_{({k,i,m})}.}$ We now calculate X(Y) iteratively. case n=0

We let ξ⁽⁰⁾(Y)=(ξ_(r) ⁽⁰⁾(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k,i,m) such that H(k,i,m).

If r corresponds to V*(k,i₁,i₂,m), we put ${\xi_{r}^{(0)}(Y)}\overset{df}{=}{{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)}.}$

If r corresponds to H(k,i,m), we put ${{\xi_{r}^{(0)}(Y)}\overset{df}{=}{f_{Y}^{(Z_{0})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,{\varphi_{k}(\alpha)},{\min\left( {i,l_{\alpha}} \right)},{\max\left( {i,l_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right)}},$ where $Z_{0}\overset{df}{=}{\left( {\ln\left( \frac{Y_{({k,i,m})}}{{\psi(Y)}_{({1,\iota_{1},m})} + {\psi(Y)}_{({k,\iota_{2},m})}} \right)} \right)_{{\alpha = 1},2}.}$

Given H(k,i,m), we have ${F_{Y}\left( Z_{0} \right)} = {{\sum\limits_{\alpha = 1}^{2}{{a_{\alpha}(Y)}{\mathbb{e}}^{{(Z_{0})}_{\alpha}}}} = {{\sum\limits_{\alpha = 1}^{2}{{a_{\alpha}(Y)}{\exp\left( {\ln\left( \frac{Y_{({k,i,m})}}{{\psi(Y)}_{({1,\iota_{1},m})} + {\psi(Y)}_{({k,\iota_{2},m})}} \right)} \right)}}} = {{\sum\limits_{\alpha = 1}^{2}{\frac{{\psi(Y)}_{({{\varphi_{k}{(\alpha)}},\iota_{\alpha},m})}}{{\psi(Y)}_{({1,\iota_{1},m})} + {\psi(Y)}_{({k,\iota_{2},m})}}Y_{({k,i,m})}}} = {Y_{({k,i,m})}.}}}}$

Then $\begin{pmatrix} {\xi^{(0)}(Y)} \\ \theta \end{pmatrix}\quad$ is normal.

We have already shown how to calculate E(Δ*S,k,i₁,i₂,m)) and cov(Δ*(S,k,i₁,i₂,m),Δ*(S,k′,i₁′,i₂′,m′)). Suppose Z=(s_(α)Δ*(S,φ_(k)(α),min(i,l_(α)),max(i,l_(α)),m))_(α=1,2), corresponding to H(k,i,m), and Z′=(s_(α)′Δ*(S,φ_(k′),(α),min(i′,l_(α′)),max(i′,l_(α)′),m))_(α=1,2), corresponding to H(k′,i′,m′), where $s_{\alpha}^{\prime}\overset{df}{=}{{s_{\alpha}^{,{({k^{\prime},i^{\prime},m^{\prime}})}}\quad{and}\quad l_{\alpha}^{\prime}}\overset{df}{=}{l_{\alpha}^{({k^{\prime},i^{\prime},m^{\prime}})}.}}$

Then, for a,a′ε

and b,b′ε

, we have ${{E\left( {a + {b^{T}Z}} \right)} = {{a + {b^{T}{E(Z)}}} = {a + {b^{T}\begin{pmatrix} {s_{1}{\mu^{(1)}(m)}\Delta\quad t_{{\min{({i,\iota_{1}})}},{\max{({i,\iota_{1}})}}}} \\ {s_{2}{\mu^{(k)}(m)}\Delta\quad t_{{\min{({i,\iota_{2}})}},{\max{({i,\iota_{2}})}}}} \end{pmatrix}}}}},{{{cov}\left( {{a + {b^{T}Z}},{a^{\prime} + {b^{\prime\quad T}Z^{\prime}}}} \right)} = {b^{T}{{cov}\left( {Z,Z^{\prime}} \right)}b^{\prime}}},{{{and}\quad{{cov}\left( {Z_{\alpha},Z_{\alpha^{\prime}}^{\prime}} \right)}} = {s_{\alpha}s_{\alpha^{\prime}}^{\prime}{{cov}\left( {\begin{pmatrix} {\varphi_{k}(\alpha)} \\ m \end{pmatrix},\begin{pmatrix} {\varphi_{k^{\prime}}(\alpha)} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{a}})}} + 1}}^{\max{({i,\iota_{a}})}}\quad{\sum\limits_{l^{\prime} = {{\min{({i^{\prime},\iota_{a^{\prime}}^{\prime}})}} + 1}}^{\max{({i^{\prime},\iota_{a^{\prime}}^{\prime}})}}{\delta_{l,l^{\prime}}\Delta\quad t_{l}}}}}},$ so that ${{{cov}\left( {{a + {b^{T}Z}},{a^{\prime} + {b^{\prime\quad T}Z^{\prime}}}} \right)} = {\sum\limits_{\alpha = 1}^{2}{\sum\limits_{\alpha^{\prime} = 1}^{2}{b_{\alpha}b_{\alpha^{\prime}}^{\prime}s_{\alpha}}}}},{s_{\alpha^{\prime}}^{\prime}{{cov}\left( {\begin{pmatrix} {\varphi_{k}(\alpha)} \\ m \end{pmatrix},\begin{pmatrix} {\varphi_{k^{\prime}}(\alpha)} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{a}})}} + 1}}^{\max{({i,\iota_{a}})}}{\sum\limits_{l^{\prime} = {{\min{({i^{\prime},\iota_{a^{\prime}}^{\prime}})}} + 1}}^{\max{({i^{\prime},\iota_{a^{\prime}}^{\prime}})}}{\delta_{l,l^{\prime}}\Delta\quad{t_{l}.}}}}}$

We also have ${{cov}\left( {{a + {b^{T}Z}},{\Delta^{*}\left( {S,k^{\prime\prime},i_{1}^{\prime\prime},i_{2}^{\prime\prime},m^{\prime\prime}} \right)}} \right)} = {\sum\limits_{\alpha = 1}^{2}{b_{\alpha}s_{\alpha}{{cov}\left( {\begin{pmatrix} {\varphi_{k}(\alpha)} \\ m \end{pmatrix},\begin{pmatrix} k^{\prime\prime} \\ m^{\prime\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{\alpha}})}} + 1}}^{\max{({i,\iota_{a}})}}{\sum\limits_{l^{\prime\prime} = {i_{1}^{\prime\prime} + 1}}^{i_{2}^{\prime\prime}}{\delta_{l,l^{\prime\prime}}\Delta\quad{t_{l}.}}}}}}$

Thus we can calculate E(ξ⁽⁰⁾(Y)), E(θ), cov(ξ⁽⁰⁾(Y),ξ⁽⁰⁾(Y)) and cov(θ,ξ⁽⁰⁾(Y)) and therefore also E(θ|ξ⁽⁰⁾(Y)=x(Y))=E(θ)+cov(θ,ξ⁽⁰⁾(Y))cov(ξ⁽⁰⁾(Y),ξ⁽⁰⁾(Y))^(⊕)(x(Y)−E(ξ⁽⁰⁾(Y))).

Given E(θ|ξ⁽⁰⁾(Y)=x(Y)) and assuming y*=ψ(Y), we can “back out” the spreads (filling using expected spread changes) to get, say, E (S|ξ ⁽⁰⁾(Y)=x(Y))=( E (S _(t) _(i) ^((k))(m)|ξ⁽⁰⁾(Y)=x(Y)))_((k,i,m)).

We then put $S_{0}\overset{df}{=}{{\underset{\_}{E}\left( {{S\text{❘}{\xi^{(0)}(Y)}} = {x(Y)}} \right)}.}$ Note that there does not necessarily exist some X such that S₀=S(X,Y). case n>0

We let ξ^((n))(Y)=ξ_(r) ^((n))(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k,i,m) such that H(k,i,m).

If r corresponds to V*(k,i₁,i₂,m), we define ${\xi_{r}^{(n)}(Y)}\overset{df}{=}{{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)}.}$

If r corresponds to H(k,i,m), we define ${{\xi_{r}^{(n)}(Y)}\overset{df}{=}{f_{Y}^{(Z_{n})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,{\varphi_{k}(\alpha)},{\min\left( {i,l_{\alpha}} \right)},{\max\left( {i,l_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right)}},$ where $Z_{n}\overset{df}{=}{\left( \left( {s_{\alpha}{\Delta^{*}\left( {S_{n - 1},{\varphi_{k}(\alpha)},{\min\left( {i,l_{\alpha}} \right)},{\max\left( {i,l_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right).}$

Then $\begin{pmatrix} {\xi^{(n)}(Y)} \\ \theta \end{pmatrix}\quad$ is normal. Using the formulae given for the case n=0, we can calculate E(ξ^((n))(Y)), E(θ), cov(ξ^((n))(Y),ξ^((n))(Y)) and cov(θ,ξ^((n))(Y)), and therefore also E(θ|ξ^((n))(Y)=x(Y))=E(θ)+cov(θ,ξ^((n))(Y))cov(ξ^((n))(Y),ξ^((n))(Y))^(⊕)(x(Y)−E(ξ^((n))(Y))).

Given E(θ|ξ^((n))(Y)=x(Y)) and assuming y*=ψ(Y), we can “back out” the spreads (filling using expected spread changes) to get, say, E(S|ξ^((n))(Y)=x(Y))=S_(n). There does not necessarily exist some X such that S_(n)=S(X,Y), but, given H(k,i,m), we have $\begin{matrix} {{\sum\limits_{\alpha = 1}^{2}\left( S_{n} \right)_{({{\varphi_{k}{(\alpha)}},i,m})}} = {\sum\limits_{\alpha = 1}^{2}{{a_{\alpha}(Y)}{\exp\left( {\ln\left( \frac{\left( S_{n} \right)_{({{\varphi_{k}{(\alpha)}},i,m})}}{\alpha(Y)} \right)} \right)}}}} \\ {= {\sum\limits_{\alpha = 1}^{2}{{a_{\alpha}(Y)}{\exp\left( {s_{\alpha}{\Delta^{*}\left( {S_{n},{\varphi_{k}(\alpha)},{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)}}}} \\ {= {{F_{Y}\left( Z_{n + 1} \right)}\quad{and}}} \end{matrix}$ $\begin{matrix} {{f_{Y}^{(Z_{n})}\left( Z_{n + 1} \right)} = {f_{Y}^{(Z_{n})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S_{n},{\varphi_{k}(\alpha)},{\min\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right)}} \\ {{= Y_{({k,i,m})}},} \end{matrix}$ by the construction of S_(n).

We continue calculating until ∥S_(n)−S_(n−1)∥_(∞)=0.

Then we put ${S(Y)}\overset{df}{=}{{{S_{n}.\quad{Say}}\quad{S(Y)}} = {\left( {S_{({k,i,m})}(Y)} \right)_{({k,i,m})}.}}$

Then clearly K * ⁡ ( k , i , m ) ⁢ ( S ( k , i , m ) ⁡ ( Y ) = ψ ⁢   ⁢ ( Y ) ( k , i , m ) ) , and, given H(k,i,m), we have $\begin{matrix} {{\sum\limits_{\alpha = 1}^{2}{S_{({{\varphi_{k}{(\alpha)}},i,m})}(Y)}} = {\sum\limits_{\alpha = 1}^{2}{\left( S_{n} \right)_{({{\varphi_{k}{(\alpha)}},i,m})}(Y)}}} & \quad \\ {F_{Y}\left( Z_{n + 1} \right)} & \quad \\ {f_{Y}^{(Z_{n + 1})}\left( Z_{n + 1} \right)} & \quad \\ {f_{Y}^{(Z_{n})}\left( Z_{n + 1} \right)} & {\left( {Z_{n + 1} = {{Z_{n}\quad{because}\quad S_{n}} = S_{n - 1}}} \right)} \\ {Y_{({k,i,m})},} & \quad \end{matrix}$ so that H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢ S ( φ k ⁡ ( α ) , i , m ) ⁡ ( Y ) = Y ( k , i , m ) ) .

Therefore S(Y)=S(X(Y),Y), where ${X(Y)}\overset{df}{=}{\left( {{S_{({k,i,m})}(Y)} + {{S_{({1.{i.m}})}(Y)}\chi_{\{{k > 1}\}}}} \right)_{⫬ {K{({k,i,m})}}}.}$

We put ${\xi(Y)}\overset{df}{=}{{\xi^{(n)}(Y)}.}$

Thus, in all cases, we have S(X(Y),Y)=E(S|ξ(Y)=x(Y)).

Now let E(S|y=Y)=(E(S_(t) _(i) ^((k))(m))_((k,i,m)) be “backed out” from E ⁡ ( θ ❘ y * = ψ ⁡ ( Y ) ⋀ H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢ S ( φ k ⁡ ( α ) , i , m ) ⁡ ( Y ) = Y ( k , i , m ) ) ) assuming y*=ψ(Y) (filling using expected spread changes). Then E(S|y=Y) is well-defined, even though we may not know how to evaluate it: we do not necessarily know how to evaluate E ⁡ ( θ ❘ y * = ψ ⁡ ( Y ) ⋀ H ⁡ ( k , i , m ) ⁢ ( ∑ α = 1 2 ⁢ S ( φ k ⁡ ( α ) , i , m ) ⁡ ( Y ) = Y ( k , i , m ) ) ) .

We can notionally “back out” E(R|y=Y)=(E(R_(t) _(i) ^((k))(m)|y=Y))_((k,i,m)) from E(S|y=Y) by defining ${\underset{\_}{E}\left( {{{R_{t_{i}}^{(k)}(m)}\text{❘}y} = Y} \right)}\overset{df}{=}{{\underset{\_}{E}\left( {{{S_{t_{i}}^{(k)}(m)}\text{❘}y} = Y} \right)} + {{\underset{\_}{E}\left( {{{S_{t_{i}}^{(1)}(m)}\text{❘}y} = Y} \right)}{\chi_{\{{k > 1}\}}.}}}$

So we have S(X(Y),Y)=E(S|ξ(Y)=x(Y)), and ξ(Y)=x(Y) is equivalent to V * ⁡ ( k : ⁢ i 1 , i 2 , m ) ⁢ ( Δ * ⁡ ( S , ⁢ k , i 1 , i 2 , m ) = ln ⁡ ( ψ ⁡ ( Y ) ( k , i 2 , m ) ψ ⁡ ( Y ) ( k , i 1 , m ) ) ) and y*=ψ(Y) implies that V * ⁡ ( k : ⁢ i 1 , i 2 , m ) ⁢ ( Δ * ⁡ ( S , ⁢ k , i 1 , i 2 , m ) = ln ⁡ ( ψ ⁡ ( Y ) ( k , i 2 , m ) ψ ⁡ ( Y ) ( k , i 1 , m ) ) ) , and, for each H(k,i,m), f_(Y) ^((s) ^(α) ^(Δ*(S(X(Y),Y),φ) ^(k) ^((α)min(i,l) ^(α) ^(),max(i,l) ^(α) ^(),m))) ^(α=1,2) ⁾ is the affine approximation of F_(Y) at (s_(α)Δ*(S(X(Y),Y),φ_(k)(α),min(i,l_(α)),max(i,l_(α)),m))_(α=1,2), and ${F_{Y}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,{\varphi_{k}(\alpha)},{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = 1},2} \right)} = {\sum\limits_{\alpha = 1}^{2}{{S_{t_{i}}^{({\varphi_{k}{(\alpha)}})}(m)}.}}$

Thus S(X(Y),Y)≈E(S|y=Y) and R(X(Y),Y)≈E(R|y=Y).

Note that if (∀(k,i,m))

H(k,i,m), we have S(X(Y),Y)=E(S|y=Y) and R(X(Y),Y)=E(R|y=Y). We now solve for Y. We put ${Y_{0}\overset{df}{=}{{{C(\pi)}\quad{and}\quad X_{0}}\overset{df}{=}{{{{X\left( Y_{0} \right)}.\quad{For}}\quad n} \geq 1}}},{{{we}\quad{put}\quad Y_{n}}\overset{df}{=}{{{C\left( {X_{n - 1},\pi} \right)}\quad{and}\quad X_{n}}\overset{df}{=}{{X\left( Y_{n} \right)}.}}}$ We continue calculating until ∥Y_(n)−Y_(n−1)∥_(∞)=0. We then put ${Y\overset{df}{=}{{{Y_{n}\left( {= Y_{n - 1}} \right)}\quad{and}\quad X}\overset{df}{=}{X_{n}\left( {= {{X(Y)} = X_{n - 1}}} \right)}}},{{{and}\quad{get}\quad Y} = {{{C\left( {X,\pi} \right)}\quad{and}\quad X} \approx {\left( {\underset{\_}{E}\left( {{{R_{t_{i}}^{(k)}(m)}❘y} = Y} \right)} \right)_{⫬ {K{({k,i,m})}}}.}}}$ Note that, for each H(k,i,m), we have used an affine approximation of $\sum\limits_{\alpha = 1}^{2}{S_{t_{i}}^{({\varphi_{k}{(\alpha)}})}(m)}$ by a normally distributed random variable. We can take R(X,Y) to be a reasonable proxy for the modes of R_(t) _(i) ^((k))(m), for (k,i,m), conditional on the traded bond data π. Note that, for (k,i,m) with k>1, we have R_((k,i,m))(X,Y)>R_((1,i,m))(X,Y). We can use the curves (C^((k,i))(X,π))_((k,i)) to price non-traded bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N). Note

When calculating X(Y_(n)) for n>0, we can use, for each H(k,i,m), the last calculated iterate of Z_(m), depending on Y_(n−1), in place of Z₀, depending on Y_(n), as the initial estimate of the vector at which to take the affine approximation of F_(Y) _(n) . This should accelerate convergence.

Simulating the Zero Coupon Rates

Given X and Y, calculated as above, we can use E(θ|ξ(Y)=x(Y)) and cov(θ,θ|ξ(Y)=x(Y))=cov(θ,θ)−cov(θ,ξ(Y))cov(ξ(Y),ξ(Y))^(⊕)cov(ξ(Y),θ) to calculate an approximate random drawing {tilde over (θ)} of the normal random vector θ. From {tilde over (θ)} and assuming y*=ψ(Y), we can “back out” {tilde over (S)}₀=(({tilde over (S)}₀)_((k,i,m)))_((k,i,m)) by filling with simulated spread values. Note that there may not exist some X′ such that {tilde over (S)}₀=S(X′,Y). We put $\overset{\sim}{X}\overset{df}{=}\left( {\left( {\overset{\sim}{S}}_{0} \right)_{({k,i,m})} + {\left( {\overset{\sim}{S}}_{0} \right)_{({1,i,m})}\chi_{\{{k > 1}\}}}} \right)_{⫬ {K{({k,i,m})}}}$ and recalibrate the “known” rates by putting $\overset{\sim}{Y}\overset{df}{=}{{C\left( {\overset{\sim}{X},\pi} \right)}.}$ Then we can take R({tilde over (X)},{tilde over (Y)}) to be an approximate random drawing of (R_(t) _(i) ^((k))(m))_((k,i,m)) conditional on the traded bond data π, and we can use the simulated curves (C^((k,i))({tilde over (X)},π))_((k,i)) to derive simulated prices of bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N). Note

The assumption of consistency may not be satisfied if cov(ξ(Y),ξ(Y)) is singular for some Y. Put $\Gamma\overset{df}{=}{{\left\{ {\left( {k,m} \right)\text{❘}\left( {\exists i_{1}} \right)\left( {\exists i_{2}} \right){{V^{*}\left( {k,i_{1},i_{2},m} \right)}\bigwedge\left( {\exists i} \right)}{H\left( {k,i,m} \right)}} \right\}\quad{and}\quad S^{\prime}}\overset{df}{=}\left( {S^{(k)}(m)} \right)_{{({k,m})} \in \Gamma}}$ If the unconditional covariance matrix of S′ per unit interval of time is non-singular, then cov(ξ(Y),ξ(Y)) is also non-singular for any Y, and the assumption of consistency is necessarily satisfied. Modelling Successive Spreads

We assume that the issuers indexed by k=1, . . . , K are at all times in strictly decreasing order of credit quality. In fact, we can here interpret issuers to mean issuer classes, say those defined by some ratings agency, rather than individual issuers. As before, we assume that the number of maturity buckets is the same for each issuer, and the standard maturities would typically be chosen to be the same for each issuer.

For each kε{1, . . . , K} and each mε{1, . . . , β^((k))}, we define the successive spread series, S^((k))(m)=(S_(t) ^((k))(m))_(tε), by putting ${{spread}\quad{series}},{{S^{(k)}(m)} = \left( {S_{t}^{(k)}(m)} \right)_{t \in {\mathbb{R}}}},{{{by}\quad{putting}\quad{S_{t}^{(k)}(m)}}\overset{df}{=}{{R_{t}^{(k)}(m)} - {{R_{t}^{({k - 1})}(m)}{\chi_{\{{k > 1}\}}.}}}}$

We assume that ((S^((k))(m))_(m=1, . . . , β) _((k)) )_(k=1, . . . , K) is a $\sum\limits_{k = 1}^{K}\beta^{(k)}$ -dimensional Geometric Brownian Motion, thus ensuring that the successive spreads are positive. So, if we define ${{X^{(k)}(m)}\overset{df}{=}\left( {\ln\left( {S_{t}^{(k)}(m)} \right)} \right)_{t \in {\mathbb{R}}}},$ we are assuming that ((X^((k))(m)_(m=1, . . . , β) _((k)) )_(k=1, . . . , K) is a ${\sum\limits_{k = 1}^{K}\beta^{(k)}} -$ -dimensional Brownian Motion. We suppose that the parameters of this Brownian Motion are given. Let μ^((k))(m) be the mean of (the changes in) X^((k))(m) per unit interval of time, for each (k,m), and let ${cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)$ be the calculated covariance of (the changes in) X^((k))(m) and X^((k′))(m′) per unit interval of time.

We already have ${K\left( {k,i,m} \right)}\overset{df}{=}{1 \leq k \leq {K\bigwedge 0} \leq i \leq {N\bigwedge 1} \leq m \leq {{\beta^{(k)}\bigwedge\left( {\exists\alpha} \right)}{\left( {{1 \leq \alpha \leq {{N\left( {k,i} \right)}\bigwedge\tau_{\alpha}^{({k,i})}}} \in_{m}^{(k)}} \right).}}}$

Let us define ${{K^{*}\left( {k,i,m} \right)}\overset{df}{=}{{K\left( {k,i,m} \right)}\bigwedge\left( {k > 1}\Rightarrow{K\left( {{k - 1},i,m} \right)} \right)}},$

“The successive spread S_(t) _(i) ^((k))(m) is ‘known’.”

We will say that S_(t) _(i) ^((k))(m) is “known” if K*(k,i,m) and “unknown” if

K*(k,i,m).

We assume that each S^((k))(m) is “known” at some t_(i), that is, (∀kε{1, . . . , K})(∀mε{1, . . . , β^((k))})(∃i)K*(k,i,m).

For X=(X_((k,i,m)))_(K(k,i,m)) and Y=(Y_((k,i,m)))_(K(k,i,m)), we define S(X,Y)=(S_((k,i,m))(X,Y))_((k,i,m)) by putting ${S_{({k,i,m})}\left( {X,Y} \right)}\overset{df}{=}{{R_{({k,i,m})}\left( {X,Y} \right)} - {{R_{({{k - 1},i,m})}\left( {X,Y} \right)}{\chi_{\{{k > 1}\}}.}}}$

We then have ${R\left( {X,Y} \right)} = {\left( {\sum\limits_{\alpha = 1}^{k}{S_{({\alpha,i,m})}\left( {X,Y} \right)}} \right)_{({k,i,m})}.}$

We also define H ⁡ ( k 1 , k 2 , i , m ) ⁢ = df ⁢ ( k 1 = 0 ⩔ K ⁢   ⁢ ( k 1 , i , m ) ) ⩓ k 2 > k 1 + 1 ⩓ K ⁢   ⁢ ( k 2 , i , m ) ⩓ α = k 1 + 1 k 2 - 1 ⁢ ⫬ K ⁡ ( α , i , m ) . ⁢  

Then H(k₁,k₂,i,m)

k₂>1.

For Y=(Y_((k,i,m)))_(K(k,i,m)) we define ${{\psi(Y)}\overset{df}{=}\left( {Y_{({k,i,m})} - {Y_{({{k - 1},i,m})}\chi_{\{{k > 1}\}}}} \right)_{K^{*}{({k,i,m})}}},$ the “known” successive spreads implied by the “known” rates. Proposition

For W=(W_((k,i,m)))_((k,i,m)) and Y=(Y_((k,i,m)))_(K(k,i,m)) we have (∃X)(W=S(X,Y))

⋀ H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( ∑ α = k 1 + 1 k 2 ⁢ W ( α , i , m ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) . Proof

(

)

Suppose that X=(X_((k,i,m)))_(K(k,i,m)) satisfies W=S(X,Y).

Then, for all (k,i,m), we have $\begin{matrix} {{\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} = {\sum\limits_{\alpha = 1}^{k}S_{{({\alpha,i,m})}{({X,Y})}}}} \\ {= R_{{({k,i,m})}{({X,Y})}}} \\ {= {{X_{({k,i,m})}\chi_{\{{⫬ {K{({k,i,m})}}}\}}} + {Y_{({k,i,m})}{\chi_{\{{⫬ {K{({k,i,m})}}}\}}.}}}} \end{matrix}$

Suppose K*(k,i,m).

case k=1

Then W_((k,i,m))=Y_((k,i,m))=ψ(Y)_((k,i,m)).

case k>1

Then K(k,i,m) and K(k−1,i,m), so that $\begin{matrix} {W_{({k,i,m})} = {{\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} - {\sum\limits_{\alpha = 1}^{k - 1}W_{({\alpha,i,m})}}}} \\ {= {R_{{({k,i,m})}{({X,Y})}} - R_{{({{k - 1},i,m})}{({X,Y})}}}} \\ {= {Y_{{({k,i,m})}{({X,Y})}} - Y_{{({{k - 1},i,m})}{({X,Y})}}}} \\ {= {{\psi(Y)}_{({k,i,m})}.}} \end{matrix}$

Thus we have shown K * ⁡ ( k , i , m ) ⁢ ( W ( k , i , m ) = ψ ⁢   ⁢ ( Y )   ⁢( k , i , m ) ) .

Now suppose H(k₁,k₂,i,m).

case k₁=0

Then K(k₂,i,m), so that $\begin{matrix} {{\sum\limits_{\alpha = {{k\quad 1} + 1}}^{k_{2}}W_{({\alpha,i,m})}} = {\sum\limits_{\alpha = 1}^{k_{2}}W_{({\alpha,i,m})}}} \\ {= R_{{({k_{2},i,m})}{({X,Y})}}} \\ {= Y_{{({k_{2},i,m})}{({X,Y})}}} \\ {= {Y_{{({k_{2},i,m})}{({X,Y})}} - {Y_{{({k_{1},i,m})}{({X,Y})}}{\chi_{\{{k_{1} > 0}\}}.}}}} \end{matrix}$ case k₁>0

Then K(k₂,i,m) and K(k₁,i,m), so that $\begin{matrix} {{\sum\limits_{\alpha = {{k\quad 1} + 1}}^{k_{2}}W_{({\alpha,i,m})}} = {{\sum\limits_{\alpha = 1}^{k_{2}}W_{({\alpha,i,m})}} - {\sum\limits_{\alpha = 1}^{k_{1}}W_{({\alpha,i,m})}}}} \\ {= {R_{{({k_{2},i,m})}{({X,Y})}} - R_{{({k_{1},i,m})}{({X,Y})}}}} \\ {= {Y_{{({k_{2},i,m})}{({X,Y})}} - Y_{{({k_{1},i,m})}{({X,Y})}}}} \\ {= {Y_{{({k_{2},i,m})}{({X,Y})}} - {Y_{{({k_{1},i,m})}{({X,Y})}}{\chi_{\{{k_{1} > 0}\}}.}}}} \end{matrix}$

Thus we have shown H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( ∑ α = k 1 + 1 k 2 ⁢ W ( α , i , m ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) .

(

)

Now suppose K * ⁡ ( k , i , m ) ⁢ ( W ( k , i , m ) = ψ ⁡ ( Y ) ( k , i , m ) ) ⋀ H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( ∑ α = k 1 + 1 k 2 ⁢ W ( α , i , m ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) .

We put $X\overset{df}{=}\left( {\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} \right)_{⫬ {K{({k,i,m})}}}$ and show that W=S(X,Y).

We first show that ${\left. {K\left( {k,i,m} \right)}\Rightarrow Y_{({k,i,m})} \right. = {\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}}},$ which we prove by induction. Let us define $H_{n}\overset{df}{=}{\left( {\forall k} \right)\left( {\forall i} \right)\left( {\forall m} \right){\left( {\left. \left( {{{K\left( {k,i,m} \right)}\bigwedge{\left\{ {k^{\prime}❘{{1 \leq k^{\prime} < k} ⩓ {K\left( {k^{\prime},i,m} \right)}}} \right\} }} = n} \right)\Rightarrow Y_{({k,i,m})} \right. = {\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}}} \right).}}$

It is enough to show H_(n) for all n≧0. We first show H₀. Suppose K(k,i,m) and |{k′|1≦k′<k

K(k′,i,m)}|=0. Then H(0,k,i,m), so that ${{\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} = {{\sum\limits_{\alpha = {0 + 1}}^{k}W_{({\alpha,i,m})}} = Y_{({k,i,m})}}},$ by our assumption. Now suppose H₀, . . . , H_(n−1) for some n>0. We show H_(n). Suppose K(k,i,m) and |{k′|1≦k′<k

K(k′,i,m)}|=n. Then there is a k*ε{1, . . . , k−1} such that H(k*,k,i,m). Thus we have K(k*,i,m) and |{k′|1≦k′<k*

K(k′,i,m)}|<n, whence, by the induction hypothesis, $Y_{({k^{*},i,m})} = {\sum\limits_{\alpha = 1}^{k}{W_{({\alpha,i,m})}.}}$ But H(k*,k,i,m) implies that $Y_{({k,i,m})} = {{Y_{({k^{*},i,m})} + {\sum\limits_{\alpha = {k^{*} + 1}}^{k}W_{({\alpha,i,m})}}} = {{{\sum\limits_{\alpha = 1}^{k^{*}}W_{({\alpha,i,m})}} + {\sum\limits_{\alpha = {k^{*} + 1}}^{k}W_{({\alpha,i,m})}}} = {\sum\limits_{\alpha = 1}^{k}{W_{({\alpha,i,m})}.}}}}$

Thus we have H_(n) for all ${n \geq 0},{{{and}\quad{R\left( {X,Y} \right)}} = \left( {\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} \right)_{({k,i,m})}},$ so that ${S\left( {X,Y} \right)} = {\left( {{R_{({k,i,m})}\left( {X,Y} \right)} - {{R_{({{k - 1},i,m})}\left( {X,Y} \right)}\chi_{\{{k > 1}\}}}} \right)_{({k,i,m})} = {\left( {{\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} - {\sum\limits_{\alpha = 1}^{k - 1}{W_{({\alpha,i,m})}\chi_{\{{k > 1}\}}}}} \right)_{({k,i,m})} = {\left( W_{({k,i,m})} \right)_{({k,i,m})} = {W.}}}}$

Note that the proof shows that if (∃X)(W=S(X,Y)), then such an X is unique (and is equal to $\left( {\sum\limits_{\alpha = 1}^{k}W_{({\alpha,i,m})}} \right)_{- {K{({k,i,m})}}}$ ).

Now suppose that H(k₁,k₂,i,m). Then, for α=k₁+1, . . . , k₂, we choose l_(α)=l_(α) ^((k) ¹ ^(,k) ² ^(,i,m))ε{0, 1, . . . , N} such that |t_(l) _(α) −t_(i)|=inf{|t_(i′)−t_(i)||K*(α,i′,m)} and K*(α,l_(α),m). The existence of each l_(α) follows from the assumption that each S^((k))(m) is “known” at some date. l_(α) is the time index of the “known” spread of the form S_(t) _(i′) ^((α))(m) that is closest in time to S_(t) _(i) ^((α))(m). There may be two choices for l_(α). We also have l_(α)≠i because H(k₁,k₂,i,m) implies that

K*(α,i,m), for α=k₁+1, . . . , k₂. We also define $s_{\alpha} = {s_{\alpha}^{({k_{1},k_{2},i,m})}\overset{df}{=}{\chi_{{\{{l_{\alpha} < i}\}} -}{\chi_{\{{l_{\alpha} > i}\}}.}}}$ Definitions ${S\overset{df}{=}{{\left( {S_{t_{i}}^{(k)}(m)} \right)_{({k,i,m})}.{\Delta^{*}\left( {W,k,i_{1},i_{2},m} \right)}}\overset{df}{=}{\ln\left( \frac{W\left( {k,i_{2},m} \right)}{W\left( {k,i_{1},m} \right)} \right)}}},{{{for}{\quad\quad}W} = {\left( W_{({k,i,m})} \right)_{({k,i,m})}.}}$

Then, given H(k₁,k₂,i,m), the Geometric Brownian Motion assumption implies that S_(t) _(i) ^((α))(m)=S_(t) _(t) ^((α))(m)exp(s_(α)Δ*(S,α,min(i,t_(α)),max(i,t_(α)),m)),

for α=k₁+1, . . . , k₂. We will sometimes use the alternative notation S_((k,i,m)) for S_(t) _(i) ^((k))(m).

As before, we define $y\overset{df}{=}{\left( {R_{t_{i}}^{(k)}(m)} \right)_{K{({k,i,m})}}.}$

We also define $y^{*}\overset{df}{=}{\left( {S_{t_{i}}^{(k)}(m)} \right)_{K^{*}{({k,i,m})}}.}$ Note that y=Y implies that y*=ψ(Y).

Let us also define V * ⁡ ( k , i 1 , i 2 , m ) ⁢ = df ⁢ i 2 > i 1 ⩓ K * ⁡ ( k , i 1 , m ) ⩓ K * ⁡ ( k , i 2 , m ) ⩓ α = i 1 + 1 i 2 - 1 ⁢ ⫬ K * ⁡ ( k , α , m ) ⁢   ⁢ and ⁢   ⁢ Δ ⁢   ⁢ K * ⁡ ( k , i , m ) ⁢ = df ⁢ K * ⁡ ( k , i , m ) ⩓ K * ⁡ ( k , i - 1 , m ) .

We put $\theta\overset{df}{=}{\left( {\Delta^{*}\left( {S,k,{i - 1},i,m} \right)} \right)_{\Delta\quad{K^{*}{({k,i,m})}}}.}$

Suppose that we are given Y=(Y_((k,i,m)))_(K(k,i,m)), an estimate of the “known” zero coupon rates. First suppose (∀(k₁,k₂,i,m))

H(k₁,k₂,i,m).

We then put ${\xi\overset{df}{=}\left( {\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)} \right)_{V^{*}{({k,i_{1},i_{2},m})}}},{{x(Y)}\overset{df}{=}{\left( {\ln\left( \frac{{\psi(Y)}_{({k,i_{2},m})}}{{\psi(Y)}_{({k,i_{1},m})}} \right)} \right)_{V^{*}{({k,i_{1},i_{2},m})}}.}}$

Then $\begin{pmatrix} \xi \\ \theta \end{pmatrix}\quad$ is normal. Now E(Δ*(S,k,i ₁ ,i ₂ ,m))=Δt _(i) ₁ _(,i) ₂ μ^((k))(m), where ${{\Delta\quad t_{i_{1},i_{2}}}\overset{df}{=}{t_{i_{2}} - t_{i_{1}}}},$ and ${{cov}\left( {{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)},{\Delta^{*}\left( {S,k^{\prime},i_{1}^{\prime},i_{2}^{\prime},m^{\prime}} \right)}} \right)} = {{{cov}\left( {\begin{pmatrix} k \\ m \end{pmatrix},\begin{pmatrix} k^{\prime} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {i_{1} + 1}}^{i_{2}}{\sum\limits_{l^{\prime} = {i_{1}^{\prime} + 1}}^{i_{2}^{\prime}}{\delta_{l,l^{\prime}}\Delta\quad{t_{l}.}}}}}$

Thus we can calculate E(ξ), E(θ), cov(ξ,ξ), cov(θ,ξ) (and cov(θ,θ)), and therefore also E(θ|ξ=x(Y))=E(θ)+cov(θ,ξ)cov(ξ,ξ)^(⊕)(x(Y)−E(ξ)).

Given E(θ␣ξ=x(Y)) and assuming y*=ψ(Y), we can fill the spreads, using expected spread changes, to get, say, E (S|ξ=x(Y))=( E (S _(t) _(i) ^((k))(m)|ξ=x(Y)))_((k,i,m)).

But then we have K * ⁡ ( k , i , m ) ⁢ ( E _ ⁢   ⁢ ( S t i ( k ) ⁡ ( m ) ❘ ξ = x ⁢   ⁢ ( Y ) ) = ψ ⁢   ⁢ ( Y ) ( k , i , m ) ) ⁢   ⁢ and ⁢   ⁢ ( ∀ ( k 1 , k 2 , i , m ) ) ⁢ ⫬ H ⁢   ⁢ ( k 1 , k 2 , i , m ) , so that E(S|ξ=x(Y))=S(X(Y),Y), where ${X(Y)}\overset{df}{=}{\left( {\sum\limits_{\alpha = 1}^{k}{\underset{\_}{E}\left( {{{S_{t_{i}}^{(\alpha)}(m)}❘\xi} = {x(Y)}} \right)}} \right)_{- {K{({k,i,m})}}}.}$

We put ${\xi(Y)}\overset{df}{=}{\xi.}$

Now suppose that (∃(k₁,k₂,i,m))H(k₁,k₂,i,m).

For each (k₁,k₂,i,m) satisfying H(k₁,k₂,i,m), let us define ${a_{\alpha}(Y)} = {{a_{\alpha}^{({k_{1},k_{2},i,m})}(Y)}\overset{df}{=}{\psi(Y)}_{({\alpha,l_{\alpha},m})}}$ for α=k₁+1, . . . , k₂, and ${F_{Y}(Z)} = {{F_{Y}^{({k_{1},k_{2},i,m})}(Z)}\overset{df}{=}{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{\mathbb{e}}^{Z_{\alpha}}}}}$ for Z=(Z_(α))_(α=k) ₁ _(+1, . . . , k) ₂ ε

^(k) ² ^(−k) ¹ .

Then, given H(k₁,k₂,i,m) and y=Y, we have $\begin{matrix} {{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{S_{t_{i}}^{(\alpha)}(m)}} = {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{S_{t_{\iota_{\alpha}}}^{(\alpha)}(m)}{\exp\left( {s_{\alpha}{\Delta^{*}\left( {S,\alpha,{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)}}}} \\ {= {{F_{Y}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,\alpha,{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = {k_{1} + 1}},\ldots\quad,k_{2}} \right)}.}} \end{matrix}$

But F_(Y)((s_(α)Δ*(S,α,min(i,l_(α)),max(i,l_(α)),m))_(α=k) ₁ _(+1, . . . , k) ₂ ) is not, in general, normal because F_(Y) is non-linear. Let (f_(Y) ^((k) ¹ ^(,k) ² ^(,i,m)))^((Z) ⁽⁰⁾ ⁾, or just f_(Y) ^((Z) ⁽⁰⁾ ⁾, be the affine approximation of F_(Y) at Z⁽⁰⁾=(Z_(α) ⁽⁰⁾)_(α=k) ₁ _(+1, . . . , k) ₂ ε

^(k) ² ^(−k) ¹ . Then, given Z=(Z_(α))_(α=k) ₁ _(+1, . . . , k) ₂ ε

^(k) ² ^(−k) ¹ , we have $\begin{matrix} {{f_{Y}^{(Z^{(0)})}(Z)} = {{F_{Y}\left( Z^{(0)} \right)} + {{F_{Y}^{\prime}\left( Z^{(0)} \right)}\left( {Z - Z^{(0)}} \right)}}} \\ {= {{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{\mathbb{e}}^{Z_{\alpha}^{(0)}}}} + {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{\frac{\partial F}{\partial Z_{\alpha}}\left( Z^{(0)} \right)\left( {Z_{\alpha} - Z_{\alpha}^{(0)}} \right)}}}} \\ {= {{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{\mathbb{e}}^{Z_{\alpha}^{(0)}}}} + {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{{\mathbb{e}}^{Z_{\alpha}^{(0)}}\left( {Z_{\alpha} - Z_{\alpha}^{(0)}} \right)}}}}} \\ {= {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{{{\mathbb{e}}^{Z_{\alpha}^{(0)}}\left( {1 + Z_{\alpha} - Z_{\alpha}^{(0)}} \right)}.}}}} \end{matrix}$

So, for any Z⁽⁰⁾ε

^(k) ² ^(−k) ¹ (and given H(k₁,k₂,i,m)), f_(Y) ^((Z) ⁽⁰⁾ ⁾(Z) is of the form a+b^(T)Z for some aε

, ${b = {\begin{pmatrix} b_{k_{1} + 1} \\ \vdots \\ b_{k_{2}} \end{pmatrix} \in {\mathbb{R}}^{k_{2} - k_{1}}}},$ assuming that Z is represented as a column vector.

We let x(Y)=(x_(r)(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k₁,k₂,i,m) such that H(k₁,k₂,i,m). If r corresponds to V*(k,i₁,i₂,m), we put ${{x_{r}(Y)}\overset{df}{=}{\ln\left( \frac{{\psi(Y)}_{({k,i_{2},m})}}{{\psi(Y)}_{({k,i_{1},m})}} \right)}},$ and if r corresponds to H(k₁,k₂,i,m), we put ${x_{r}(Y)}\overset{df}{=}{Y_{({k_{2},i,m})} - {Y_{({k_{1},i,m})}{\chi_{\{{k_{1} > 0}\}}.}}}$

We now calculate X(Y) iteratively.

case n=0

We let ξ⁽⁰⁾(Y)=(ξ_(r) ⁽⁰⁾(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k₁,k₂,i,m) such that H(k₁,k₂,i,m).

If r corresponds to V*(k,i₁,i₂,m), we put ${\xi_{r}^{(0)}(Y)}\overset{df}{=}{{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)}.}$

If r corresponds to H(k₁,k₂,i,m), we put ${{\xi_{r}^{(0)}(Y)}\overset{df}{=}{f_{Y}^{(Z_{0})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,\alpha,{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = {k_{1} + 1}},\ldots\quad,k_{2}} \right)}},\quad{{{where}\quad Z_{0}}\overset{df}{=}\left( {\ln\left( \frac{Y_{({k_{2},i,m})} - {Y_{({k_{1},i,m})}\chi_{\{{k_{1} > 0}\}}}}{\sum\limits_{\alpha^{\prime} = {k_{1} + 1}}^{k_{2}}{a_{\alpha^{\prime}}(Y)}} \right)} \right)_{{\alpha = {k_{1} + 1}},\ldots\quad,k_{2}}}$

A straightforward calculation shows that H(k₁,k₂,i,m) implies that F _(Y)(Z ₀)=Y _((k) ₂ _(,i,m)) −Y _((k) ₁ _(,i,m))χ_({k) ₁ _(>0}).

Then $\begin{pmatrix} {\xi^{(0)}(Y)} \\ \theta \end{pmatrix}\quad$ is normal.

We have already shown how to calculate E(Δ*(S,k,i₁,i₂,m)) and cov(Δ*(S,k,i₁,i₂,m),Δ*(S,k′,i₁′,i₂′,m′)). Suppose Z=(s_(α)Δ*(S,α,min(i,l_(α)),max(i,l_(α)),m))_(α=k) ₁ _(+1, . . . , k) ₂ , corresponding to H(k₁,k₂,i,m), and Z′=(s′_(α)Δ*(S,α,min(i′,l_(α′),max(i′,l) _(α)), m))_(α=k) ₁ _(′+1, . . . , k) ₂ _(′), corresponding to H(k₁′,k₂,i′,m′), where $s_{\alpha}^{\prime}\overset{df}{=}{{s_{\alpha}^{({k_{1}^{\prime},k_{2}^{\prime},i^{\prime},m^{\prime}})}\quad{and}\quad l_{\alpha}^{\prime}}\overset{df}{=}{l_{\alpha}^{({k_{1}^{\prime},k_{2}^{\prime},i^{\prime},m^{\prime}})}.}}$ Then, for a,a′ ${{\in {{\mathbb{R}}\quad{and}\quad b}} = \begin{pmatrix} b_{k_{1} + 1} \\ \vdots \\ b_{k_{2}} \end{pmatrix}},{b^{\prime} = {\begin{pmatrix} {b^{\prime}}_{k_{1}^{\prime} + 1} \\ \vdots \\ b_{k_{2}^{\prime}}^{\prime} \end{pmatrix} \in {\mathbb{R}}^{k_{2} - k_{1}}}},$ we have ${{E\left( {a + {b^{T}Z}} \right)} = {{a + {b^{T}{E(Z)}}} = {a + {b^{T}\begin{pmatrix} {s_{k_{1} + 1}{\mu^{({k_{1} + 1})}(m)}\Delta\quad t_{{\min{({{i_{,}\iota_{k_{1}}} + 1})}},{\max{({i,{\iota_{k_{1}} + 1}})}}}} \\ \vdots \\ {s_{k_{2}}{\mu^{(k_{2})}(m)}\Delta\quad t_{{\min{({i,\iota_{k_{2}}})}},{\max{({i,\iota_{k_{2}}})}}}} \end{pmatrix}}}}},{{{cov}\left( {{a + {b^{T}Z}},{a^{\prime} + {b^{\prime\quad T}Z^{\prime}}}} \right)} = {b^{T}{{cov}\left( {Z,Z^{\prime}} \right)}b^{\prime}}},{{{and}\quad{{cov}\left( {Z_{\alpha},Z_{\alpha^{\prime}}^{\prime}} \right)}} = {s_{\alpha}s_{\alpha^{\prime}}^{\prime}{{cov}\left( {\begin{pmatrix} \alpha \\ m \end{pmatrix},\begin{pmatrix} \alpha^{\prime} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{\alpha}})}} + 1}}^{\max{({i,\iota_{\alpha}})}}{\sum\limits_{l^{\prime} = {{\min{({i^{\prime},\iota_{\alpha^{\prime}}^{\prime}})}} + 1}}^{\max{({i^{\prime},\iota_{\alpha^{\prime}}^{\prime}})}}{\delta_{l,l^{\prime}}\Delta\quad t_{l}}}}}},{{{for}\quad\alpha} = {k_{1} + 1}},\ldots\quad,{{k_{2}\quad{and}\quad\alpha^{\prime}} = {k_{1}^{\prime} + 1}},\ldots\quad,k_{2}^{\prime},{{{so}\quad{that}\quad{{cov}\left( {{a + {b^{T}Z}},{a^{\prime} + {b^{\prime\quad T}Z^{\prime}}}} \right)}} = {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{\sum\limits_{\alpha^{\prime} = {k_{1}^{\prime} + 1}}^{k_{2}^{\prime}}{b_{\alpha}b_{\alpha}^{\prime}}}}},{s_{\alpha}s_{\alpha}^{\prime}},{{{cov}\left( {\begin{pmatrix} \alpha \\ m \end{pmatrix},\begin{pmatrix} \alpha^{\prime} \\ m^{\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{\alpha}})}} + 1}}^{\max{({i,\iota_{\alpha}})}}{\sum\limits_{l^{\prime} = {{\min{({i^{\prime},\iota_{\alpha^{\prime}}^{\prime}})}} + 1}}^{\max{({i^{\prime},\iota_{\alpha^{\prime}}^{\prime}})}}{\delta_{l,l^{\prime}}\Delta\quad{t_{l}.}}}}}$

We also have ${{cov}\left( {{a + {b^{T}Z}},{\Delta^{*}\left( {S,k^{\prime\prime},i_{1}^{\prime\prime},i_{2}^{\prime\prime},m^{\prime\prime}} \right)}} \right)} = {\sum\limits_{\alpha = 1}^{2}{b_{\alpha}s_{\alpha}{{cov}\left( {\begin{pmatrix} \alpha \\ m \end{pmatrix},\begin{pmatrix} k^{\prime\prime} \\ m^{\prime\prime} \end{pmatrix}} \right)}{\sum\limits_{l = {{\min{({i,\iota_{\alpha}})}} + 1}}^{\max{({i,\iota_{\alpha}})}}{\sum\limits_{l^{\prime\prime} = {i_{1}^{\prime\prime} + 1}}^{i_{2}^{\prime\prime}}{\delta_{l,l^{\prime\prime}}\Delta\quad{t_{l}.}}}}}}$

Thus we can calculate E(ξ⁽⁰⁾(Y)), E(θ), cov(ξ⁽⁰⁾(Y),ξ⁽⁰⁾(Y)) and cov(θ,ξ⁽⁰⁾(Y)), and therefore also E(θ|ξ⁽⁰⁾(Y)=x(Y))=E(θ)+cov(θ,ξ⁽⁰⁾(Y))cov(ξ⁽⁰⁾(Y),ξ⁽⁰⁾(Y))^(⊕)(x(Y)−E(ξ⁽⁰⁾(Y))).

Given E(θ|ξ⁽⁰⁾(Y)=x(Y)) and assuming y*=ψ(Y), we can “back out” the spreads (filling using expected spread changes) to get, say, E (S|ξ ⁽⁰⁾(Y)=x(Y))=( E (S _(t) _(i) ^((k))(m)|ξ⁽⁰⁾(Y)=x(Y)))_((k,i,m)).

We then put $S_{0}\overset{df}{=}{{\underset{\_}{E}\left( {{S\text{❘}{\xi^{(0)}(Y)}} = {x(Y)}} \right)}.}$ Note that there does not necessarily exist some X such that S₀=S(X,Y). case n>0

We let ξ^((n))(Y)=(ξ_(r) ^((n))(Y))_(r) be indexed by all (k,i₁,i₂,m) such that V*(k,i₁,i₂,m) and by all (k₁,k₂,i,m) such that H(k₁,k₂,i,m).

If r corresponds to V*(k,i₁,i₂,m), we define ${\xi_{r}^{(n)}(Y)}\overset{df}{=}{{\Delta^{*}\left( {S,k,i_{1},i_{2},m} \right)}.}$

If r corresponds to H(k₁,k₂,i,m), we define ${{\xi_{r}^{(n)}(Y)}\overset{df}{=}{f_{Y}^{(Z_{n})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S,\alpha,{\min\left( {i,l_{\alpha}} \right)},{\max\left( {i,l_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = {k_{1} + 1}},\ldots,k_{2}} \right)}},$ where $Z_{n}\overset{df}{=}{\left( \left( {s_{\alpha}{\Delta^{*}\left( {S_{n - 1},\alpha,{\min\left( {i,l_{\alpha}} \right)},{\max\left( {i,l_{\alpha}} \right)},m} \right)}} \right)_{{\alpha = {k_{1} + 1}},\ldots,k_{2}} \right).}$

Then $\begin{pmatrix} {\xi^{(n)}(Y)} \\ \theta \end{pmatrix}\quad$ is normal. Using the formulae given for the case n=0, we can calculate E(ξ^((n))(Y)), E(θ), cov(ξ^((n))(Y),ξ^((n))(Y)) and cov(θ,ξ^((n))(Y)), and therefore also E(θ|ξ^((n))(Y)=x(Y))=E(θ)+cov(θ,ξ^((n))(Y))cov(ξ^((n))(Y),ξ^((n))(Y))^(⊕)(x(Y)−E(ξ^((n))(Y))).

Given E(θ|ξ^((n))(Y)=x(Y)) and assuming y*=ψ(Y), we can “back out” the spreads (filling using expected spread changes) to get, say, E(S|ξ^((n))(Y)=x(Y))=S_(n). There does not necessarily exist some X such that S_(n)=S(X,Y), but, given H(k₁,k₂,i,m), we have $\begin{matrix} {{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}\left( S_{n} \right)_{({\alpha,i,m})}} = {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}{\exp\left( {\ln\left( \frac{\left( S_{n} \right)_{({\alpha,i,m})}}{\alpha(Y)} \right)} \right)}}}} \\ {= {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{a_{\alpha}(Y)}\exp}}} \\ {\left( {s_{\alpha}{\Delta^{*}\left( {S_{n},\alpha,{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)} \\ {= {F_{Y}\left( Z_{n + 1} \right)}} \end{matrix}$ and $\begin{matrix} {{f_{Y}^{(Z_{n})}\left( Z_{n + 1} \right)} = {f_{Y}^{(Z_{n})}\left( \left( {s_{\alpha}{\Delta^{*}\left( {S_{n},\alpha,{\min\left( {i,\iota_{\alpha}} \right)},} \right.}} \right. \right.}} \\ \left. \left. \left. {{\max\left( {i,\iota_{\alpha}} \right)},m} \right) \right)_{{\alpha = {k_{1} + 1}},\ldots\quad,k_{2}} \right) \\ {{= {Y_{({k_{2},i,m})} - {Y_{({k_{1},i,m})}\chi_{\{{k_{1} > 0}\}}}}},} \end{matrix}$ by the construction of S_(n). We continue calculating until ∥S_(n)−S_(n−1)∥_(∞)=0.

Then we put ${S(Y)}\overset{df}{=}{{{S_{n}.\quad{Say}}\quad{S(Y)}} = {\left( {S_{({k,i,m})}(Y)} \right)_{({k,i,m})}.}}$

Then clearly K * ⁡ ( k , i , m ) ⁢ ( S ( k , i , m ) ⁡ ( Y ) = ψ ⁢   ⁢ ( Y ) ( k , i , m ) ) , and, given H(k₁,k₂,i,m), we have $\begin{matrix} {{\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{S_{({\alpha,i,m})}(Y)}} = {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{\left( S_{n} \right)_{({\alpha,i,m})}(Y)}}} \\ {= {F_{Y}\left( Z_{n + 1} \right)}} \\ {= {f_{Y}^{(Z_{n + 1})}\left( Z_{n + 1} \right)}} \\ {= {{f_{Y}^{(Z_{n})}\left( Z_{n + 1} \right)}\quad\left( {Z_{n + 1} = {{Z_{n}\quad{because}\quad S_{n}} = S_{n - 1}}} \right)}} \\ {{= {Y_{({k_{2},i,m})} - {Y_{({k_{1},i,m})}\chi_{\{{k_{1} > 0}\}}}}},} \end{matrix}$ so that H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( ∑ α = k 1 + 1 k 2 ⁢ S ( α , i , m ) ⁡ ( Y ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) .

Therefore S(Y)=S(X(Y),Y), where ${X(Y)}\overset{df}{=}{\left( {\sum\limits_{\alpha = 1}^{k}{S_{({\alpha,i,m})}(Y)}} \right)_{⫬ {K{({k,i,m})}}}.}$

We put ${\xi(Y)}\overset{df}{=}{{\xi^{(n)}(Y)}.}$

Thus, in all cases, we have S(X(Y),Y)=E(S|ξ(Y)=x(Y)).

Now let E(S|y=Y)=(E(S_(t) _(i) ^((k))(m))_((k,i,m)) be “backed out” from E ⁡ ( θ | y * = ψ ⁡ ( Y ) ⋀ H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( ∑ α = k 1 + 1 k 2 ⁢ S ( α , i , m ) ⁡ ( Y ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) ) assuming y*=ψ(Y) (filling using expected spread changes). Then E(S|y=Y) is well-defined, even though we may not know how to evaluate it. We can notionally “back out” E(R|y=Y)=(E(R_(t) _(i) ^((k))(m)|y=Y))_((k,i,m)) from E(S|y=Y) by defining ${\underset{\_}{E}\left( {\left. {R_{t_{i}}^{(k)}(m)} \middle| y \right. = Y} \right)}\overset{df}{=}{\sum\limits_{\alpha = 1}^{k}{{\underset{\_}{E}\left( {\left. {S_{t_{i}}^{(k)}(m)} \middle| y \right. = Y} \right)}.}}$

So we have S(X(Y),Y)=E(S|ξ(Y)=x(Y)), and ξ(Y)=x(Y) is equivalent to V * ⁡ ( k , i 1 , i 2 , m ) ⁢ ( Δ * ⁡ ( S , k , i 1 , i 2 , m ) = ln ⁡ ( ψ ⁡ ( Y ) ( k , i 2 , m ) ψ ⁡ ( Y ) ( k , i 1 , m ) ) ) ⋀ H ⁡ ( k 1 , k 2 , i , m ) ⁢ ( f Y ( ( s α ⁢ Δ * ⁡ ( S ⁡ ( X ⁡ ( Y ) , Y ) , α , min ⁡ ( i , ι α ) , max ⁡ ( i , ι α ) , m ) ) α = k 1 + 1 , … ⁢   , k 2 ) ⁢   ( ( s α ⁢ Δ * ⁡ ( S , α , min ⁡ ( i , ι α ) , max ⁡ ( i , ι α ) , m ) ) α = k 1 + 1 , … ⁢   , k 2 ) = Y ( k 2 , i , m ) - Y ( k 1 , i , m ) ⁢ χ { k 1 > 0 } ) , and y*=ψ(Y) implies that V * ⁡ ( k , i 1 , i 2 , m ) ⁢ ( Δ * ⁡ ( S , k , i 1 , i 2 , m ) = ln ⁡ ( ψ ⁡ ( Y ) ( k , i 2 , m ) ψ ⁡ ( Y ) ( k , i 1 , m ) ) ) , and, for each H(k₁, k₂, i, m), f_(Y) ^(s) ^(α) ^(Δ*(S(X(Y), Y), α, min(t, t) ^(α) ^(), max(t, t) ^(α) ^(), m))) ^(α=k1) ^(+1, . . . , k2) ⁾ is the affine approximation of F_(Y) at (s_(α)Δ*(S(X(Y),Y),α,min(i,l_(α)),max(i,l_(α)),m))_(α=k) ₁ _(+1, . . . , k) ₂ , and $\left. {F_{Y}\left( {s_{\alpha}{\Delta^{*}\left( {S,\alpha,{\min\left( {i,\iota_{\alpha}} \right)},{\max\left( {i,\iota_{\alpha}} \right)},m} \right)}} \right)}_{{\alpha = {k_{1} + 1}},\ldots\quad,k_{2}} \right) = {\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}{{S_{t_{i}}^{(\alpha)}(m)}.}}$

Thus S(X(Y),Y)≈E(S|y=Y) and R(X(Y),Y)≈E(R|y=Y).

Note that if (∀(k₁,k₂,i,m))

H(k₁,k₂,i,m), we have S(X(Y),Y)=E(S|y=Y) and R(X(Y),Y)=E(R|y=Y). We now solve for Y. We put ${Y_{0}\overset{df}{=}{{{C(\pi)}\quad{and}\quad X_{0}}\overset{df}{=}{{{{X\left( Y_{0} \right)}.\quad{For}}\quad n} \geq 1}}},{{{we}\quad{put}\quad Y_{n}}\overset{df}{=}{{{C\left( {X_{n - 1},\pi} \right)}\quad{and}\quad X_{n}}\overset{df}{=}{{X\left( Y_{n} \right)}.}}}$ We continue calculating until ∥Y_(n)−Y_(n−1)∥_(∞)=0. We then put ${Y\overset{df}{=}{{{Y_{n}\left( {= Y_{n - 1}} \right)}\quad{and}\quad X}\overset{df}{=}{X_{n}\left( {= {{X(Y)} = X_{n - 1}}} \right)}}},{{{and}\quad{get}\quad Y} = {{{C\left( {X,\pi} \right)}\quad{and}\quad X} \approx {\left( {\underset{\_}{E}\left( {{{R_{t_{i}}^{(k)}(m)}\text{❘}y} = Y} \right)} \right)_{⫬ {K{({k,i,m})}}}.}}}$ Note that, for each H(k₁,k₂,i,m), we have used an affine approximation of $\sum\limits_{\alpha = {k_{1} + 1}}^{k_{2}}\quad{S_{t_{i}}^{(\alpha)}(m)}$ by a normally distributed random variable. We can take R(X,Y) to be a reasonable proxy for the modes of R_(t) _(i) ^((k))(m), for (k,i,m), conditional on the traded bond data π. Note that, for (k,i,m) with k>1, we have R_((k,i,m))(X,Y)>R_((k−1,i,m))(X,Y). We can use the curves (C^((k,i))(X,π))_((k,i)) to price non-traded bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N). Note

When calculating X(Y_(n)) for n>0, we can use, for each H(k₁,k₂,i,m), the last calculated iterate of Z_(m), depending on Y_(n−1), in place of Z₀, depending on Y_(n), as the initial estimate of the vector at which to take the affine approximation of F_(Y) _(n) . This should accelerate convergence.

Simulating the Zero Coupon Rates

Given X and Y, calculated as above, we can use E(θ|ξ(Y)=x(Y)) and cov(θ,θ␣ξ(Y)=x(Y))=cov(θ,θ)−cov(θ,ξ(Y))cov(ξ(Y),ξ(Y))^(⊕)cov(ξ(Y),θ) to calculate an approximate random drawing {tilde over (θ)} of the normal random vector θ. From {tilde over (θ)} and assuming y*=ψ(Y), we can “back out” {tilde over (S)}₀=(({tilde over (S)}₀)_((k,i,m)))_((k,i,m)) by filling with simulated spread values. Note that there may not exist some X′ such that {tilde over (S)}₀=S(X′,Y). We can then put $\overset{\sim}{X}\overset{df}{=}{\left( {\sum\limits_{\alpha = 1}^{k}\quad\left( {\overset{\sim}{S}}_{0} \right)_{({k,i,m})}} \right)_{⫬ {K{({k,i,m})}}}.}$

Alternatively:

-   -   For (k,i,m), either there is a unique k′ such that 0 < k ′ < k ⩓         K ⁢   ⁢ ( k ′ , i , m ) ⩓ α = k ′ + 1 k - 1 ⁢ ⫬ K ⁡ ( α , i , m )     -   or no such k′ exists. Let φ(k,i,m) be the unique such k′ if it         exists or 0 if it does not exist. Then we can define {tilde over         (X)}=(({tilde over (X)})_((k,i,m)))_(K(k,i,m)) by putting         ${\left( \overset{\sim}{X} \right)_{({k,i,m})}\overset{df}{=}{Y_{{{({{\varphi{({k,i,m})}},i,m})}\chi{\{{{\varphi{({k,i,m})}} > 0}\}}} +}{\sum\limits_{\alpha = {{\varphi{({k,i,m})}} + 1}}^{k}\quad\left( {\overset{\sim}{S}}_{0} \right)_{({\alpha,i,m})}}}},$     -    for         K(k,i,m). In the case where         K(k,i,m) and K(k′,i,m) for some k′>k, we can incorporate an         error adjustment in the definition of ({tilde over         (X)})_((k,i,m)). In this case, we can put         ${k_{0}\overset{df}{=}{\varphi\left( {k,i,m} \right)}},{k_{1}\overset{df}{=}{\inf\left\{ {k^{\prime}❘{k < k^{\prime} \leq {K\bigwedge{K\left( {k^{\prime},i,m} \right)}}}} \right\}}},{{\varepsilon\left( {k_{0},k_{1},i,m} \right)}\overset{df}{=}{\frac{Y_{({k_{1},i,m})} - Y_{{({k_{0},i,m})}\chi{\{{k_{0} > 0}\}}} - {\sum\limits_{\alpha = {k_{0} + 1}}^{k_{1}}\quad\left( {\overset{\sim}{S}}_{0} \right)_{({\alpha,i,m})}}}{k_{1} - k_{0}}.}}$

Note that we have ${Y_{({k_{1},i,m})} - Y_{{({k_{0},i,m})}\chi{\{{k_{0} > 0}\}}}} \approx {\sum\limits_{\alpha = {k_{0} + 1}}^{k_{1}}\quad{\left( {\overset{\sim}{S}}_{0} \right)_{({\alpha,i,m})}.}}$

We can then put $\left( \overset{\sim}{X} \right)_{({k,i,m})}\overset{df}{=}{Y_{{({k_{0},i,m})}\chi{\{{k_{0} > 0}\}}} + {\sum\limits_{\alpha = {k_{0} + 1}}^{k_{1}}\quad\left( {\overset{\sim}{S}}_{0} \right)_{({\alpha,i,m})}} + {\left( {k - k_{0}} \right){{\varepsilon\left( {k_{0},k_{1},i,m} \right)}.}}}$

We recalibrate the “known” rates by putting $\overset{\sim}{Y}\overset{df}{=}{{C\left( {\overset{\sim}{X},\pi} \right)}.}$ We can then take R({tilde over (X)},{tilde over (Y)}) to be an approximate random drawing of (R_(t) _(i) ^((k))(m))_((k,i,m)) conditional on the traded bond data π. We can use the simulated curves (C^((k,i))({tilde over (X)},π))_(k,i)) to derive simulated prices of bonds of issuers 1, . . . , K at the trading dates D₀, . . . , D_(N). Note

The assumption of consistency may not be satisfied if cov(ξ(Y),ξ(Y)) is singular for some Y. Put $\Gamma\overset{df}{=}\left\{ {\left( {k,m} \right)\text{❘}\left( {\exists i_{1}} \right)\left( {\exists i_{2}} \right){{V^{*}\left( {k,i_{1},i_{2},m} \right)}\bigwedge\left( {\exists k_{1}} \right)}\left( {\exists k_{2}} \right)\left( {\exists i} \right)\left( {{k_{1} + 1} \leq k \leq {k_{2}\bigwedge{H\left( {k_{1},k_{2},i,m} \right)}}} \right)} \right\}$ and $S^{\prime}\overset{df}{=}{\left( {S^{(k)}(m)} \right)_{{({k,m})} \in \Gamma}.}$ If the unconditional covariance matrix of S′ per unit interval of time is non-singular, then cov(ξ(Y),ξ(Y)) is also non-singular for any Y, and the assumption of consistency is necessarily satisfied. Notes

-   -   1. Convergence is not guaranteed. For given inputs, a solution         may not exist. If calibration yields a negative spread or a         negative zero coupon rate that is modelled as a GBM, the         algorithm will fail. If the assumed unconditional dynamics and         the traded bond data together produce extreme conditions, the         numerical methods employed may fail. In the case of modelling         spreads, the numerical methods may also fail if the maturity         bucketing is too coarse for the variability in the spreads         implied by the traded bond data. If convergence is not         sufficiently fast, it can occasionally help to take the next         iterate to be, say, the average of the last two iterates. We         have only ever found this to be useful for the inner (affine         approximation) loop for modelling spreads.     -   2. One could use norms other than ∥ ∥_(∞) to test for         convergence: any two norms on a finite-dimensional vector space         are topologically equivalent.     -   3. The iterative technique of modelling zero coupon rate curves         as a (G)BM can be adapted to handle implied volatility curves,         futures curves, forward foreign exchange curves and other         curves. By way of example, let us consider implied volatility         curves. We can have an implied volatility curve for each         underlying asset of the options with which one is concerned. The         role of bond issuers is replaced by that of underlying assets.         For each asset, one can specify, for options on the asset, a set         of maturity buckets and associated standard maturities, as well         as an interpolation function for the implied volatilities. The         unconditional implied volatility dynamics can be specified as a         GBM in several dimensions. Note that implied volatilities can         never be negative. The traded implied volatility data is given         by specifying observed implied volatilities. Each of these         requires the specification of not only the implied volatility         (expressed, say, as an annualised figure), but also the maturity         of the associated option, the underlying asset and the date on         which the option traded. Each standard maturity implied         volatility is then defined to be “known” at a given date if an         option traded on the given date and the maturity of the option         fell in the bucket associated with the standard maturity and the         underlying asset of the option is that associated with the         implied volatility. One needs to assume that each standard         maturity implied volatility is “known” at at least one date. The         algorithms described for modelling zero coupon rate curves carry         over to the modelling of implied volatility curves except that         there is no calibration step because the observed implied         volatilities are given directly. One would, of course, need to         interpolate the “known” standard maturity implied volatilities         from the observed implied volatilities and from the observed         implied volatilities together with estimates of the standard         maturity implied volatilities that are not “known”. One could         model separate implied volatility curves for puts and for calls.         One could add an extra dimension, say, for the degree to which         an option was in- or out-of-the-money at the time of the trade.         In this case one would specify, for each asset, a set of buckets         and associated standard points for this second dimension. The         unconditional implied volatility dynamics would then be based on         ordered pairs, each consisting of a standard maturity and a         standard point for the second dimension. One would also need to         specify interpolation functions of two variables to allow         interpolation from the resulting implied volatility surfaces.     -   4. It is possible to remove the requirement that, for each         issuer and each trading date, the maturities of the traded bonds         be distinct. This requires modifying our calibration functions.         Let us suppose that an issuer and a trading date are given as         are estimates of the “unknown” zero coupon rates. Given a         maturity which is the maturity of several traded bonds, one         could solve numerically, as described previously, for the zero         coupon rates of the given maturity for each of the traded bonds,         and then take the average value as an approximate solution of         the calibration equations (one for each traded bond of the given         maturity). With this modification, we get approximate values of         the zero coupon rates, one for each bond maturity, and these         provide an approximate solution of the set of calibration         equations (one for each traded bond). Given this approximate         solution as a starting point, one then uses a standard technique         for solving simultaneous nonlinear equations in several         variables or one uses a multidimensional optimisation technique         such as the downhill simplex method or Powell's method to solve         the calibration equations as closely as possible. Note that the         estimates of the “unknown” zero coupon rates appear as constants         in the calibration equations.     -   5. The methodology can handle real, as opposed to nominal, zero         coupon rates or spreads and capital-indexed bonds. One can also         combine the modelling of real and nominal zero coupon rates or         spreads.     -   6. One can use the given zero coupon rate or spread modelling         for each of several economies and combine them using         inter-economy correlations.     -   7. One can also combine the given zero coupon rate or spread         modelling with the modelling of other rates such as foreign         exchange rates or stock indices.         Internalising the Calibration Process

The calibration functions that we defined earlier depended on the assumed zero coupon rate or spread dynamics only to the extent that the zero coupon rate or spread dynamics were incorporated into the current estimates of the “unknown” zero coupon rates. We now show how the calibration process can be made to depend directly on the assumed zero coupon rate or spread dynamics.

Suppose we have a traded bond whose issuer is (indexed by) kε{1, . . . , K}, whose yield is y and whose trading date is D_(i) and whose associated time is t_(i), for some iε{0, 1, . . . , N}. Let ((τ_(j),X_(j)))_(jε{1, . . . , α}) be the cash-flow schedule of the bond, where, for jε{1, . . . , α}, X_(j) is the cash payment at maturity τ_(j) days (actual days from the trading date D_(i)). Let τ_(σ) be the maturity (in days) of the settlement of the bond. Put $n\overset{df}{=}\beta^{(k)}$ (the number of maturity buckets for issuer k), and, for jε{1, . . . , n}, $m_{j}\overset{df}{=}M_{j}^{(k)}$ (the standard maturities for issuer k) and $r_{j}\overset{df}{=}{R_{t_{i}}^{(k)}(j)}$ (the standard maturity zero coupon rate for issuer k and trading date D_(i)). Let B be the base, that is, the notional number of days in the year, specified for issuer k. Let I_({(m) ₁ _(,r) ₁ _(), . . . , (m) _(n) _(,r) _(n) _()}) be the specified interpolation function for issuer k, based on the points (m₁,r₁), . . . , (m_(n),r_(n)). Without loss of generality, we can suppose that I_({(m) ₁ _(,r) ₁ _(), . . . , (m) _(n) _(,r) _(n) _()}) returns, for a given maturity τ (actual days from D_(i)), a continuously compounding zero coupon rate of base B.

We suppose that the function $\left\{ \begin{pmatrix} r_{1} \\ \cdots \\ r_{n} \end{pmatrix}\mapsto{I_{\{{{({m_{1},r_{1}})},\quad\ldots\quad,{({m_{n},r_{n}})}}\}}(\tau)} \right\}$ is differentiable, as a function of several variables, for the given maturities m₁, . . . , m_(n) and for any given maturity τ. This function is differentiable if the specified method of interpolation is, for example, linear, logarithmic linear, cubic spline or logarithmic cubic spline (on any basis), even though the function I_({(m) ₁ _(,r) ₁ _(), . . . , (m) _(n) _(,r) _(n) _()}) is not, in general, differentiable if the method of interpolation is linear or logarithmic linear.

Then we can express the calibration requirement for the given traded bond by the equation ${{{\exp\left( {{I_{\{{{({m_{1},r_{1}})},{\ldots{({m_{n},r_{n}})}}}\}}\left( \tau_{\sigma} \right)}\frac{\tau_{\sigma}}{B}} \right)}{\sum\limits_{j = 1}^{\alpha}\quad{X_{j}{\exp\left( {{- {I_{\{{{({m_{1},r_{1}})},{\ldots{({m_{n},r_{n}})}}}\}}\left( \tau_{j} \right)}}\frac{\tau_{j}}{B}} \right)}}}} = {P^{(k)}(y)}},$ where P^((k)) is the pricing function specified for bonds of issuer k. Note that the left hand side of the equation is a differentiable function of the zero coupon rate vector $\begin{pmatrix} r_{1} \\ \cdots \\ r_{n} \end{pmatrix}$ and the right hand side is a calculated constant.

Thus we can express the calibration requirement for all the traded bonds (for all issuers and all trading dates) as a set of non-linear simultaneous equations (one equation for each traded bond) where the unknown variables are all random. This is true in the case of modelling spread series as a GBM as well in the case of modelling zero coupon rate series as a (G)BM because zero coupon rates are affine functions of spreads (and spreads are affine functions of zero coupon rates). In the case of modelling spread series as a GBM, the unknown variables can all be taken to be spreads.

Zero Coupon Rate Series Modelled as a (G)BM

First of all, we need to assume not only that each standard maturity zero coupon rate series is “known” at at least one of the specified times t₀, t₁, . . . , t_(N) (or, equivalently, at at least one of the specified trading dates), but also that each of these zero coupon rate series is “unknown” at at least one of the specified times. We will see shortly the reason for this latter requirement. This new requirement can always be satisfied by adding, if need be, a new date (and associated time), at which all the zero coupon rates are necessarily “unknown”, to the set of specified trading dates.

As before, we calculate the “knowns” and “unknowns” in turn until successive iterates for the “knowns” are equal (that is, until convergence is reached). There are no changes to the method of calculation of the first iterate of the “knowns”. There are no changes to the method of calculation of any of the iterates of the “unknowns”, given the “knowns”, except that they must be based on expected zero coupon rate changes and not on expected zero coupon rates. Suppose that we are to calculate a second or later iterate of the “knowns”, given the current estimate of the “unknowns” and the traded bond yields for all issuers and all trading dates. So, at this stage, the “knowns” have unknown values (are unknown) and the “unknowns” have known values (are known). As we showed above, we can express the calibration requirement, depending on the given traded yields, as a set of simultaneous equations whose unknown variables are the standard maturity zero coupon rates. Now some of these zero coupon rates are known (that is, are “unknown”) and the others are unknown (that is, are “known”). Thus we get a set of simultaneous equations whose unknown variables are the “known” standard maturity zero coupon rates.

Let us consider a “known” standard maturity zero coupon rate, say R_(t) _(i) ^((k))(m) for mε{1, . . . , β^((k))}. Our assumption above means that the zero coupon rate series R^((k))(m) has at least one “unknown”. Thus we can choose some l=l^((k,i,m)) such that

K(k,l,m) and |t_(l)−t_(i)|=inf{|t_(j)−t_(i)||

K(k,j,m)}. Put ${⫬ {{K\left( {k,\iota,m} \right)}\quad{and}\quad{{t_{l} - t_{i}}}}} = {\inf\left\{ {{{{t_{j} - t_{i}}}{\left. {⫬ {K\left( {k,j,m} \right)}} \right\}.\quad{Put}}\quad s^{({k,i,m})}}\overset{df}{=}{ϰ_{\{{\iota < i}\}} - {ϰ_{\{{\iota > i}\}}.}}} \right.}$ Then, if R^((k))(m) is a BM, we have R_(t) _(i) ^((k))(m)=R_(t) _(i) ^((k))(m)+s^((k,i,m))Δ(R,k,min(i,l),max(i,l),m), and, if R^((k))(m) is a GBM, we have R_(t) _(i) ^((k))(m)=R_(t) _(l) ^((k))(m)exp(s^((k,i,m))Δ(R,k,min(i,l), max(i,l),m)).

Note that the value of R_(t) _(l) ^((k))(m) is known because R_(t) _(l) ^((k))(m), is “unknown” (

K(k,l,m)).

We can then replace each occurrence of an unknown (“known”) standard maturity zero coupon rate in the simultaneous equations by an expression involving an unknown zero coupon rate change of the form Δ(R,k,min(i,l),max(i,l),m). In fact, the left hand side of each equation becomes a differentiable function of such unknown zero coupon rate changes. Then, by a process of iterative refinement of affine approximations similar to that used before for the calculation of the “unknowns” in the case of spread modelling (successive spreads or spreads over a base issuer), we can derive the expected values of the unknown zero coupon rate changes. This makes use of the zero coupon rate dynamics. At each step of this iteration, the left hand side of each calibration equation, as a function of the unknown zero coupon rate changes figuring in the equation, is replaced by its affine approximation, depending on the applicable method of interpolation, and we add (to the conditioning) a linearised constraint for each calibration equation. The iteration (the affine approximation loop) requires recalculating, for each calibration equation, the vector of unknown zero coupon rate changes at which to take the affine approximation. We also have “vertical” constraints corresponding to “runs” (where a “run” corresponds to a zero coupon rate which is “unknown” (known) at two distinct trading dates and “known” (unknown) at each intermediate trading date). These “vertical” constraints do not change from one iteration to another of the affine approximation loop. Assuming convergence, we get the non-linear constraints satisfied exactly. The iterative process makes use of the assumed zero coupon rate dynamics as well as the estimates of the “unknown” zero coupon rate values and the traded yields, and handles all issuers and trading dates together. Given the expected values of the unknown zero coupon rate changes and the “unknown” zero coupon rate values, we can then “back out” the next iterate of the “known” zero coupon rate values.

Once the outer loop converges (that is, when successive iterates for the “knowns” are equal), the “knowns” and “unknowns” together determine the calibrated standard maturity curves based on expected zero coupon rate changes. With the new calibration process, there is no version based on expected zero coupon rates (as opposed to expected zero coupon rate changes). Note also that zero coupon curves are not constructed with maturities corresponding to the maturities of traded bonds (unless such maturities happen to be standard maturities) and that the definition of calibrated traded bonds no longer depends on restricting the maturities of the constructed curves.

To simulate calibrated zero coupon rate curves, we can simulate the “unknown” zero coupon rates, given the “knowns” provided by the curves based on expected zero coupon rate changes. Then we can calibrate the “knowns” as shown above, but using the simulated “unknowns” (together with the traded bond yields). Then the simulated “unknowns” together with the calibrated “knowns” derived from them determine the simulated calibrated zero coupon rate curves (which are mutually correlated). This simulation process can be carried out as many times as desired.

Zero Coupon Rate Spread Series Modelled as a GBM

Here we need to assume not only that each standard maturity zero coupon rate spread (successive spread over the base issuer) is “known” (that is, each zero coupon rate figuring in the spread (each leg, say) is “known”) at at least one of the specified times t₀, t₁, . . . , t_(N) (or, equivalently, at at least one of the specified trading dates), but also that each of these spread series has, at at least one of the specified times, each leg “unknown”. Note that this is a stronger requirement than that each spread series be “unknown” at at least one of the specified times: we require that, at some time, each leg of the spread be “unknown”. This new requirement can always be satisfied by adding, if need be, a new date (and associated time), at which all the zero coupon rates are necessarily “unknown”, to the set of specified trading dates.

As before, we calculate the “known” standard maturity zero coupon rates and the “unknown” standard maturity zero coupon rates in turn until successive iterates for the “known” zero coupon rates are equal (that is, until convergence is reached). There are no changes to the method of calculation of the first iterate of the “known” zero coupon rates. There are no changes to the method of calculation of any of the iterates of the “unknown” zero coupon rates, given the “known” zero coupon rates. Suppose that we are to calculate a second or later iterate of the “known” zero coupon rates, given the current estimate of the “unknown” zero coupon rates and the traded bond yields for all issuers and all trading dates. So, at this stage, the “known” zero coupon rates have unknown values (are unknown) and the “unknown” zero coupon rates have known values (are known). As we showed above, we can express the calibration requirement, depending on the given traded yields, as a set of simultaneous equations whose unknown variables are the standard maturity zero coupon rates. But each standard maturity zero coupon rate is an affine function of standard maturity zero coupon rate spreads. So we have, in fact, a set of simultaneous equations whose unknown variables are the standard maturity zero coupon rate spreads. Now some of these spreads are known (that is, their values are determined by the “unknown” zero coupon rates) and the others are unknown (that is, their values are not determined by the “unknown” zero coupon rates). Thus we get a set of simultaneous equations whose unknown variables are the unknown spreads. But by our assumption above, each spread series has, at some trading date, each leg “unknown” (this is not equivalent to each spread series being “unknown” at some trading date). Thus each spread is known at some trading date.

Let us consider an unknown standard maturity zero coupon rate spread, say S_(t) _(i) ^((k))(m) for mε{1, . . . , β^((k))}. First suppose that k=1, so that the spread has one leg. Our assumption above means that we can choose some l=l^((k,i,m)) such that

K(k,l,m) and |t_(l)−t_(i)|=inf{|t_(j)−t_(i)||

K(k,j,m)}. Put $s^{({k,i,m})}\overset{df}{=}{ϰ_{\{{\iota < i}\}} - {ϰ_{\{{\iota > i}\}}.}}$ Then we have S_(t) _(i) ^((k))(m)=S_(t) _(l) ^((k))(m)exp(s^((k,i,m))Δ*(S,k,min(i,l),max(i,l),m)).

Note that the value of S_(t) _(l) ^((k))(m) is known because S_(t) _(l) ^((k))(m)=R_(t) _(l) ^((k))(m) and R_(t) _(l) ^((k))(m) is “unknown” (

K(k,l,m)). Now suppose that k>1, so that the spread has two legs. Then S^((k))(m)=R^((k))(m)−R^((k′))(m) for some k′. If we are modelling successive spreads, then k′=k−1. If we are modelling spreads over a base issuer, then k′=1. Our assumption above means that we can choose some l=l^((k,i,m)) such that

(k,l,m)

K(k′,l,m) and |t_(l)−t_(i)|inf{|t_(j)−t_(i)||

K(k,j,m)

K(k′,j,m)}.

Put $s^{({k,i,m})}\overset{df}{=}{ϰ_{\{{\iota < i}\}} - {ϰ_{\{{\iota > i}\}}.}}$ Then we have S_(t) _(i) ^((k))(m)=S_(t) _(l) ^((k))(m)exp(s^((k,i,m))Δ*(S,k,min(i,l),max(i,l),m)). Note that the value of S_(t) _(l) ^((k))(m) is known because R_(t) _(l) ^((k))(m) and R_(t) _(l) ^((k′))(m) are both “unknown” (

K(k,l,m)

K(k′,l,m)).

We can then replace each occurrence of an unknown spread in the simultaneous equations by an expression involving an unknown spread change of the form Δ(S,k,min(i,l),max(i,l),m). In fact, the left hand side of each equation becomes a differentiable function of such unknown spread changes. Then, by a process of iterative refinement of affine approximations similar to that used before for the calculation of the “unknown” zero coupon rates in the case of spread modelling, we can derive the expected values of the unknown spread changes. In this iteration, the left hand side of each calibration equation, as a function of the unknown spread changes figuring in the equation, is replaced by its affine approximation, and we add (to the conditioning) a linearised constraint for each calibration equation. These linearised constraints need to be recomputed at each step in the iteration. We have “vertical” constraints, corresponding to “runs” of spreads, which do not change from one iteration to another of the affine approximation loop. We also have “horizontal” constraints similar to those used in the calculation of “unknown” zero coupon rates from “known” zero coupon rates, except that here the role that the “known” zero coupon rates played is played by the “unknown” (known) zero coupon rates. Once these “horizontal” constraints are expressed in terms of unknown spread changes, they are non-linear and require affine approximations which need to be recomputed at each step in the iteration. Assuming convergence, we get the non-linear constraints satisfied exactly. Given the expected values of the unknown spread changes and the known spread values, determined by the “unknown” zero coupon rates, we can “back out” the unknown spreads. Then the unknown spreads and the known spreads determine the next iterate of the “known” zero coupon rate values which, together with the “unknown” zero coupon rate values, are calibrated with the traded yields.

Once the outer loop converges (that is, when successive iterates for the “known” zero coupon rates are equal), the “known” and “unknown” zero coupon rates together determine the calibrated standard maturity curves based on expected zero coupon rate changes.

To simulate calibrated zero coupon curves, we can simulate the “unknown” zero coupon rates, given the “known” zero coupon rates provided by the curves based on expected zero coupon rate changes. Then we can calibrate the “known” zero coupon rates as shown above, but using the simulated “unknown” zero coupon rates (together with the traded bond yields). Then the simulated “unknown” zero coupon rates together with the calibrated “known” zero coupon rates derived from them determine the simulated calibrated zero coupon rate curves. This simulation process can be carried out as many times as desired.

In practice, we will need to make the additional assumption that, for any given issuer, maturity bucket and trading date, there is at most one traded bond of the given issuer whose trading date is the given trading date and whose maturity falls in the given maturity bucket. The reason for this assumption is, essentially, that one factor (the standard maturity zero coupon rate, at the given trading date, for the given issuer and maturity bucket) is, in general, inadequate to explain variation that may be multidimensional. This assumption is applicable both in the case where zero coupon rate series are modelled as a (G)BM and in the case where spread series are modelled as a GBM.

Mean Reversion

The stochastic differential equation for a one-dimensional mean-reverting Brownian Motion is X=(X_(t))_(tεR), is dX_(t)=(μ−αX_(t))dt+σdW_(t), where μ is the long term average, per unit interval of time, of the process increments, α≧0 is the speed of mean-reversion and σ≧0 is the standard deviation, per unit interval of time, of the process increments, and W=(W_(t))_(tεR) is a standard Brownian Motion (mean zero, variance one). This generalises the notion of a Brownian Motion (take α=0 to get a Brownian Motion with mean μ and variance σ² per unit interval of time). In the case where α>0, $\frac{\mu}{\alpha}$ is called the level of mean reversion.

A one-dimensional mean-reverting Geometric Brownian Motion is a stochastic process of the form exp(X) where X=(X_(t))_(tεR) is a mean-reverting Brownian Motion. This generalises the notion of a Geometric Brownian Motion.

See Kloeden P., Platen E., Numerical Solution of Stochastic Differential Equations, Springer-Verlag, 1992, where the terminology used is normal mean-reverting process for mean-reverting Brownian Motion and lognormal mean-reverting process for mean-reverting Geometric Brownian Motion.

One can extend these notions to the case of several dimensions.

Let X be a one-dimensional mean-reverting Brownian Motion. Given X_(t), the value of X at time t, there are formulae for the mean and variance of X_(t+Δt) for Δt>0. This requires the evaluation of stochastic integrals. One can show that the process increment X_(t+Δt)−X_(t) is normally distributed, conditional on the known value for X_(t). Then X_(t+Δt) is also normally distributed, conditional on the known value for X_(t).

In the case of higher-dimensional mean-reverting Brownian Motions, one can show that given the vector of values of the processes at time t, the vector of process increments over the time interval [t, t+Δt] is multivariate normal.

Corresponding results can be shown for mean-reverting Geometric Brownian Motions.

Suppose we have incomplete rate data, for a mean-reverting Brownian Motion in several dimensions, at several points in time. Suppose also that each rate is known at at least one point in time. We can choose one known rate, say, the first known, for each rate series. We can then calculate the multivariate normal distribution of the rate changes, for the several rate series and the time intervals determined by successive points in time, conditional on these known rates (exactly one per rate series). This distribution plays the role that the unconditional distribution of rate changes played earlier for non-mean-reverting Brownian Motions. We can then use all the incomplete rate data to determine known and unknown rate changes and calculate the multivariate normal distribution of the unknown rate changes conditional on the known rate changes taking their known values as we did before. We can then fill the unknown rates as we did before for non-mean-reverting Brownian Motions.

This analysis is easily adapted to mean-reverting Geometric Brownian Motions and can be carried through to the application to modelling zero coupon rate curves. It is straight-forward to combine mean-reverting Brownian Motions and mean-reverting Geometric Brownian Motions.

Unconditional Serial Correlation

We now show how the assumption of the existence of a Brownian Motion in several dimensions can be weakened to allow for unconditional serial correlation of rate changes. Note that the Brownian Motion assumption implies that rate changes in several dimensions are serially uncorrelated and, in fact, are serially independent. We suppose, as before, that we have several rate series, a number of specified points in time and a set of incomplete rate data and that each rate series has a known value at at least one of the specified points in time. We also suppose that we have, for each rate series, a specification of its parametric model type as normal or lognormal. These are both parametric probability distributions: a random variable is lognormally distributed if the natural logarithm of the random variable is normally distributed. This corresponds to our former specification of parametric model types (Brownian Motion/Geometric Brownian Motion) for the several rate series. If a rate series is specified as normal, then its rate changes are understood to be differences of rates. If a rate series is specified as be lognormal, then its rate changes are understood to be differences of natural logarithms of rates. We then suppose that the random vector of all rate changes over single time intervals is unconditionally multivariate normal, a single time interval being understood to mean a time interval determined by consecutive specified points in time, and that the parameters of the unconditional multivariate normal distribution are specified. This requires a specification of the unconditional mean for each rate change over a single time interval and a specification of the unconditional covariance for each pair of rate changes over single, possibly different, time intervals, or one could specify unconditional correlations and unconditional standard deviations and calculate the unconditional covariances. Then the rest of the analysis, including the application to modelling zero coupon rate curves, can be carried through except that any simplifications of formulae that were justified by the Brownian Motion assumption are not made if they are not justified by the weakened assumptions.

INDUSTRIAL APPLICABILITY

The present invention provides commercial value in the field of financial modelling. It may be used to provide more accurate input rate data for the historical or Monte Carlo simulation of portfolio values and for the more accurate pricing (and hedging) of individual financial instruments or of portfolios of financial instruments. These applications are important to investment banks and other financial institutions for assessing the values of deals and trading portfolios and for measuring the risks arising out of deals and trading portfolios. More accurate methods of assessing value have direct effects on the profitability of trading activities. More accurate methods of measuring risk-permit more effective management of risk and more efficient allocation of risk capital.

The present invention allows missing rates in historical rate series to be filled in a manner that is statistically consistent with observed rates. In a historical simulation, rate changes derived from filled historical rate series are used to simulate future values of trading portfolios which, in turn, are used to derive measures of the credit and market risk of the trading portfolios. More accurate methods of filling historical rate data lead to more accurate measures of risk.

Monte Carlo simulations of the credit or market risk of trading portfolios are normally based on complete sets of current rates. The present invention allows Monte Carlo simulations to be based on incomplete sets of recent rates. A further advantage of the present invention is that it allows the modelling of value and risk to be based on specific hypotheses or scenarios concerning the future levels of rates. This allows greater refinement in the so-called “stress testing” of portfolios where the impact of specific adverse rate scenarios on portfolio values is analysed.

The present invention may also be used for the more accurate pricing (and hedging) of financial instruments. Unobserved input rates required for pricing models may be estimated or simulated in a manner that takes account of other rates, possibly observed at other times. For example, to value an option of some given maturity that has not recently traded, the option's implied volatility may be estimated or simulated from the calculated implied volatilities of recently traded options (on the same asset) of possibly different maturities. Note that the implied volatility of a traded option is the volatility, over the life of the option, of the price of the underlying asset of the option which, when used as the input in an option pricing model, gives a fair value equal to observed market price of the option. Another possibility for valuing options and other types of derivative financial instruments is to use the conditional rate dynamics based on an incomplete set of recent rates to simulate contingent pay-offs. Simulated pay-offs would allow the estimation of the expected value of a pay-off and this could be discounted to the present using the appropriate risk-free rate to provide a fair value. This approach would require a shift from the real world dynamics to risk-neutral dynamics.

The present invention may also be used to validate data used for pricing and risk analysis. The detection and removal of spurious data contribute to the integrity of systems for pricing and risk management.

The present invention also has potential application to time series other than the rate series of financial markets.

It will be appreciated by persons skilled in the art that many variations and/or modifications may be made to the invention as shown in the specific embodiments without departing from the spirit or scope of the invention as broadly described. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive.

It is noted that the present invention can be expressed as a computer program or software to cause a computer to perform the method. The computer program can have data input means to receive the assumed unconditional dynamics or unconditional distribution, as appropriate, and the incomplete rate data or traded bond data, as appropriate. The computer program can have data output means to output the modelled values. The computer program can have the modelling engine to carry out the steps defined by the method.

It is also noted that the term conditional zero coupon rate dynamics is used to denote the zero coupon rate dynamics implied by the unconditional zero coupon rate dynamics and the traded bond data (specified bond trades).

Further, it is noted that in Australia, the base issue may be chosen to be the Commonwealth of Australia. For each pair of issuers, the maturities of the specified zero coupon rate series for the two issuers can correspond.

Specifying the unconditional dynamics of the zero coupon rate spreads series as Geometric Brownian Motion ensures that modelled zero coupon rate spreads are positive, which can accord with assumptions made about the relative credit quality of the issuers. Zero coupon rate curve may include maturity points corresponding to the maturities of the traded bonds whose issuers and trading dates are associated with the curve.

The term conditional zero coupon rate dynamics can be used to denote the zero coupon rate dynamics implied by the unconditional zero coupon rate spread dynamics and the traded bond data (specified bond trades). For example, the step of populating the unknown rates with simulated values may be carried out by taking a random drawing from the multidimensional conditional probability distribution of the unknown rate changes and then inferring the simulated values from the random drawing of the unknown rate changes and the known rate values.

It is noted that rate dynamics is understood to mean a probabilistic model of how rate series change in value over time. Further, the term conditional rate dynamics denotes the rate dynamics implied by the unconditional rate dynamics and the known rate values.

The dimension of the problem as solved in the present method grows quickly and geometrically as both the number of rate series and the number of specified times increase. Although the assumption of Brownian motion or geometric Brownian motion implies that the rate changes in several dimensions are unconditionally serially independent, that does not mean that the rate changes in several dimensions are not conditionally serially dependent. The method of modelling may be viewed as an exercise in unravelling the nature of such multidimensional serial dependence. 

1. A system for generating a model of unknown values of several rate series at specified times for use in analyses based on the modelled unknown values, the several rate series having unconditional rate dynamics characterised by a parametric model type in several dimensions, each rate series having at least one known value, the system comprising at least one computing device configured to: receive input indicative of the parametric model type of the unconditional rate dynamics; receive input indicative of a known or unknown rate value for each rate series and for each specified time; generate the values of the known rate changes; generate an unconditional multidimensional probability distribution of the known and unknown rate changes; generate a multidimensional probability distribution of the unknown rate changes conditional on the known rate changes taking their known values; and provide an output constituting the model or values derived therefrom.
 2. A system according to claim 1 wherein the specified times are uniformly spaced and the specified unconditional rate dynamics does not depend on the known rate values.
 3. A system according to claim 1 wherein the parametric model type of each rate series is unconditionally Brownian Motion or Geometric Brownian Motion, and the parametric model type of the several rate series together is unconditionally Brownian Motion, Geometric Brownian Motion or a combination of the two, and, for each rate series, there are assigned a standard deviation and a mean of the rate changes per unit interval of time, and, for each pair of rate series, there is assigned a correlation coefficient of the rate changes per unit interval of time; or the parametric model type of each rate series is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion, and the parametric model type of the several rate series together is unconditionally mean-reverting Brownian Motion, mean-reverting Geometric Brownian Motion or a combination of the two, and, for each rate series, there are assigned a standard deviation and a mean of the rate changes per unit interval of time, a long-term average rate and a speed of mean reversion, and, for each pair of rate series, there is assigned a correlation coefficient of the rate changes per unit interval of time; or the rate changes are unconditionally multivariate normal, and, for each rate change over a time interval determined by consecutive specified times, there are assigned a standard deviation and a mean of the rate changes, and, for each pair of rate changes over time intervals determined by consecutive specified points in time, there is assigned a correlation coefficient of the rate changes.
 4. A system according to claim 1 wherein the computing device is configured to generate marginal probability distributions of the unknown rate values conditional on the known rates taking their known values, and the marginal probability distributions of the unknown rates are generated by the computing device from the generated multidimensional conditional probability distribution of the unknown rate changes and from the known rate values.
 5. A system according to claim 1 further comprising: populating the unknown rates with numerical values such that the rate changes arising out of the known rate values and the populated unknown rate values take their expected values conditional on the known rates taking their known values; or populating the unknown rates with their expected values conditional on the known rates taking their known values; or populating the unknown rates with simulated values being conditional on the known rates taking their known values.
 6. A system according to claim 5 wherein populating the unknown rates is effected using the conditional probability distribution of the unknown rate changes and the known rate values; and populating the unknown rates with simulated values is effected by taking a random drawing from the multidimensional conditional probability distribution of the unknown rate changes and then deriving the simulated values from the random drawing of the unknown rate changes and the known rate values.
 7. A system according to claim 1 wherein the time underlying the assumed rate dynamics is calendar time, trading time or other preferred time system, wherein trading time is derived from calendar time by excising non-trading periods from the time continuum, and wherein, when the time underlying the assumed rate dynamics is taken to be trading time, the computing device is configured to receive input indicative of the length in trading days of each interval of calendar time.
 8. A system for generating a model of the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the issuers for use in analyses based on the modelled dynamics, the specified zero coupon rate series having unconditional dynamics characterised by a parametric model type in several dimensions, the system comprising at least one computing device configured to: receive input indicative of the unconditional dynamics of the specified zero coupon rate series; receive input indicative of the trades in the bonds of the one or more issuers; iteratively generate the dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers; and provide an output constituting the model or values derived therefrom.
 9. A system according to claim 8 wherein the specified trading dates are uniformly spaced and the specified unconditional zero coupon rate dynamics does not depend on ate specified bond trades.
 10. A system according to claim 8 further comprising, for each issuer, configuring the computing device to receive input indicative of a bond pricing function and, for zero coupon rates of the given issuer, a compounding frequency and a notional number of days in the year.
 11. A system according to claim 8 wherein the parametric model type of each specified zero coupon rate series is unconditionally Brownian Motion or Geometric Brownian Motion, and the parametric model type of the several specified zero coupon rate series together is unconditionally Brownian Motion, Geometric Brownian Motion or a combination of the two, and, for each specified zero coupon rate series, there are assigned a standard deviation and a mean of the zero coupon rate changes per unit interval of time, and, for each pair of specified zero coupon rate series, there is assigned a correlation coefficient of the zero coupon rate changes per unit interval of time; or the parametric model type of each specified zero coupon rate series is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion, and the parametric model type of the several specified zero coupon rate series together is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion or a combination of the two, and, for each specified zero coupon rate series, there are assigned a standard deviation and a mean of the zero coupon rate changes per unit interval of time, a long-term average zero coupon rate and a speed of mean reversion, and, for each pair of specified zero coupon rate series, there is assigned a correlation coefficient of the zero coupon rate changes per unit interval of time; or the changes in the specified zero coupon rate series are unconditionally multivariate normal, and, for each specified zero coupon rate series and each time interval determined by consecutive specified times, there are assigned a standard deviation and a mean of the zero coupon rate changes, and, for each pair of specified zero coupon rate series and each pair of time intervals determined by consecutive specified points in time, there is assigned a correlation coefficient of the zero coupon rate changes.
 12. A system according to claim 8 wherein the parameters of the specified unconditional zero coupon rate dynamics are determined from historically observed trades in bonds of the one or more issuers.
 13. A system according to claim 8 wherein each trade in the bonds of the one or more issuers inputted into the computing device is assigned a trading date, an issuer, a settlement date, a maturity date, a coupon rate, a coupon frequency and a traded yield and, for each issuer and each specified trading date, the maturities of the traded bonds of the given issuer that traded on the given trading date are distinct.
 14. A system according to claim 8 wherein, for each specified zero coupon rate series, there is specified a trading date such that for each zero coupon rate series in the given zero coupon series, a specified bond trade exists having an assigned trading date being the given trading date, an assigned issuer being that of the given zero coupon rate series and an assigned maturity being close to that of the given zero coupon rate series.
 15. A system according to claim 8 comprising configuring the computing device to iteratively generate, for each issuer and for each specified trading date, an expected value of a zero coupon rate curve being conditional on the specified bond trades in the bonds of the one or more issuers, or a zero coupon rate curve comprising zero coupon rates having values being their modes conditional on the specified trades in the bonds of the one or more issuers, or a simulated zero coupon rate curve being conditional on the specified trades in the bonds of the one or more issuers.
 16. A system according to claim 15 wherein a generated zero coupon rate curve includes maturity points additional to the maturities of the specified zero coupon rate series of the issuer being associated with the curve and includes maturity points corresponding to the maturities of the traded bonds having issuers and trading dates being associated with the curve.
 17. A system according to claim 15 wherein each generated zero coupon rate curve is calibrated against the bond trades having assigned issuers and trading dates being associated with the curve, and covariance effects arising out of trades in bonds of other issuers at other trading dates are incorporated.
 18. A system according to claim 8 wherein the time underlying the zero coupon rate dynamics is measured as calendar time or as trading time or other preferred time system, and the computing device is configured to receive input specifying the length in trading days of each interval of calendar time when the time underlying the assumed zero coupon rate dynamics is trading time.
 19. A system for generating a model of the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the one or more issuers for use in analyses based on the modelled dynamics, the number of specified zero coupon rate series of each issuer being equal and the specified zero coupon rate series determining zero coupon rate spread series having unconditional dynamics characterised by a parametric model type in several dimensions, the system comprising at least one computing device configured to: receive input indicative of the unconditional dynamics of the determined zero coupon rate spread series; receive input indicative of the trades in the bonds of the one or more issuers; iteratively generate the dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers; and provide an output constituting the model or values derived therefrom.
 20. A system according to claim 19 wherein the specified trading dates are uniformly spaced and the specified unconditional zero coupon rate spread dynamics does not depend on the specified trades.
 21. A system according to claim 19 wherein the computing device is configured to receive input indicative of, for each issuer, a bond pricing function and, for zero coupon rates of the given issuer, an interpolating function, a compounding frequency, and a notional number of days in the year.
 22. A system according to claim 19 wherein one of the one or more bond issuers is specified as the base issuer having at all times a higher credit quality than the other issuers; and the determined zero coupon rate spread series comprise the specified zero coupon rate series for the base issuer and, for each issuer other than the base issuer and for each specified zero coupon rate series for the given issuer, the difference between the specified zero coupon rate series and the corresponding specified zero coupon rate series for the base issuer where the correspondence depends on the ordering of the zero coupon rate series by their associated maturities; or the one or more bond issuers are ordered in descending order of credit quality, and the determined zero coupon rate spread series comprise the specified zero coupon rate series for the base issuer and, for each issuer other than the base issuer and for each specified zero coupon rate series for the given issuer, the difference between the given zero coupon rate series and the corresponding specified zero coupon rate series for the previous issuer in the ordering of issuers by credit quality where the correspondence depends on the ordering of the zero coupon rate series by their associated maturities.
 23. A system according to claim 19 wherein: the parametric model type of each determined zero coupon rate spread series is unconditionally Brownian Motion or Geometric Brownian Motion, and the parametric model type of the several determined zero coupon rate spread series together is unconditionally Brownian Motion, Geometric Brownian Motion or a combination of the two, and, for each determined zero coupon rate spread series, there are assigned a standard deviation and a mean of the zero coupon rate spread changes per unit interval of time, and, for each pair of determined zero coupon rate spread series, there is assigned a correlation coefficient of the zero coupon rate spread changes per unit interval of time; or the parametric model type of each determined zero coupon rate spread series is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion, and the parametric model type of the several determined zero coupon rate spread series together is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion or a combination of the two, and, for each determined zero coupon rate spread series, there are assigned a standard deviation and a mean of the zero coupon rate spread changes per unit interval of time, a long-term average zero coupon rate spread and a speed of mean reversion, and, for each pair of determined zero coupon rate spread series, there is assigned a correlation coefficient of the zero coupon rate spread changes per unit interval of time; or the changes in the determined zero coupon rate spread series are unconditionally multivariate normal, and, for each determined zero coupon rate spread series and each time interval determined by consecutive specified times, there are assigned a standard deviation and a mean of the zero coupon rate spread changes, and, for each pair of determined zero coupon rate spread series and each pair of time intervals determined by consecutive specified points in time, there is assigned a correlation coefficient of the zero coupon rate spread changes.
 24. A system according to claim 19 wherein the parameters of the specified unconditional zero coupon rate spread dynamics are determined from historically observed trades in bonds of the one or more issuers.
 25. A system according to claim 19 wherein each trade in the bonds of the one or more issuers inputted into the computing device is assigned a trading date, an issuer, a settlement date, a maturity date, a coupon rate, a coupon frequency and a traded yield, and, for each issuer and each specified trading date, the maturities of the traded bonds of the given issuer that traded on the given trading date are distinct.
 26. A system according to claim 19 wherein, for each zero coupon rate spread series determined by the specified zero coupon rate series, there is a specified trading date such that for each zero coupon rate series in the given zero coupon spread series, a specified bond trade exists having an assigned trading date being the given trading date, an assigned issuer being that of the given zero coupon rate series and an assigned maturity being close to that of the given zero coupon rate series.
 27. A system according to claim 19 wherein the computing device is configured to iteratively generate, for each issuer and for each specified trading date, a zero coupon rate curve comprising zero coupon rates having values being their modes conditional on the specified trades in the bonds of the one or more issuers or a simulated zero coupon rate curve being conditional on the specified trades in the bonds of the one or more issuers.
 28. A system according to claim 27 wherein each generated zero coupon rate curve includes maturity points additional to the maturities of the specified zero coupon rate series of the issuer being associated with the curve and includes maturity points corresponding to the maturities of the traded bonds having issuers and trading dates being associated with the curve.
 29. A system according to claim 27 wherein each generated zero coupon rate curve is calibrated against the bond trades having assigned issuers and trading dates being associated with the curve, and covariance effects arising out of trades in bonds of other issuers at other dates are incorporated.
 30. A system of detecting the known values, of several rate series at specified times, that are extreme, the system comprising at least one computing device that is configured to: receive input indicative of a known or unknown rate value for each rate series and for each specified time; receive input indicative of a subset of the known rates comprising those that are to be accepted without question; receive input indicative of a confidence level and configuring the computer to generate, for each known rate that is not to be accepted without question and for each subset of the known rates that does not include the given known rate and that includes the known rates that are to be accepted without question, a confidence interval, based on the given confidence level, for the given rate conditional on the rates belonging to the given subset taking their known values; iteratively generate a subset of the known rates that are not to be accepted without question such that, for each rate belonging to the subset, the value of the rate does not lie within the confidence interval, based on the given confidence level, generated for the rate conditional on the known rates which do not belong to the subset taking their known values, and for each known rate that does not belong to the subset and that is not to be accepted without question, the value of the rate lies within the confidence interval, based on the given confidence level, generated for the rate conditional on the known rates, with the exception of the given known rate, which do not belong to the subset taking their known values; and provide an output constituting the rate values that are extreme.
 31. A system according to claim 30 wherein the rate values are known for all rate series and for all specified times, and the subset of the known rates comprising those that are to be accepted without question is chosen to be empty.
 32. A system according to claim 4, wherein the at least one computing device is further configured to: rely on the marginal probability distribution of the rate to generate a confidence interval, based upon the given confidence level, for the given rate conditional on the rates belonging to the given subset taking their known values; wherein a confidence interval is generated for each known rate that is not to be accepted without question and for each subset of the known rates that includes the known rates that are to be accepted without question and does not include the given rate.
 33. A system for generating a model of the dynamics of specified maturity-parameterised rate series at specified times conditional on specified observed values of the rate series for use in analyses based on the output model, each rate series being assigned specified maturities and the rate series with their specified maturities having unconditional dynamics characterised by a parametric model type in several dimensions, the system comprising a computing device configured to: receive input indicative of the unconditional dynamics of the specified rate series with their specified maturities; receive input indicative of the observed values of the specified rate series; iteratively generate the dynamics of the specified rate series at the specified times conditional on the specified observed values of the rate series; provide an output constituting the model or values derived therefrom.
 34. A system according to claim 33 wherein the specified times are uniformly spaced and the specified unconditional dynamics of the specified rate series with their specified maturities does not depend on the observed values of the rate series.
 35. A system according to claim 33 wherein the parametric model type of each specified rate series with a specified maturity is unconditionally Brownian Motion or Geometric Brownian Motion, and the parametric model type of the several specified rate series with their specified maturities is unconditionally Brownian Motion, Geometric Brownian Motion or a combination of the two, and, for each specified rate series with a specified maturity, there are assigned a standard deviation and a mean of the rate changes per unit interval of time, and, for each pair of specified rate series with specified maturities, there is assigned a correlation coefficient of the rate changes per unit interval of time; or the parametric model type of each specified rate series with a specified maturity is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion, and the parametric model type of the several specified rate series with their specified maturities is unconditionally mean-reverting Brownian Motion or mean-reverting Geometric Brownian Motion or a combination of the two, and, for each specified rate series with a specified maturity, there are assigned a standard deviation and a mean of the rate changes per unit interval of time, a long-term average rate and a speed of mean reversion, and, for each pair of specified rate series with specified maturities, there is assigned a correlation coefficient of the rate changes per unit interval of time; or the changes in the specified rate series with specified maturities are unconditionally multivariate normal, and, for each specified rate series with a specified maturity and each time interval determined by consecutive specified times, there are assigned a standard deviation and a mean of the rate changes, and, for each pair of specified rate series with specified maturities and each pair of time intervals determined by consecutive specified points in time, there is assigned a correlation coefficient of the rate changes.
 36. A system according to claim 33 wherein the parameters of the inputted unconditional dynamics of the specified rate series with their specified maturities are determined from historically observed values of the rate series.
 37. A system according to claim 33 wherein each of the inputted observed values of the specified rate series is assigned a time, a maturity and a numeric value.
 38. A system according to claim 33 wherein, for each specified rate series and each specified maturity, there is a specified time such that a specified observed value of the given rate series exists having an assigned time being the given time and an assigned maturity being close to the given maturity, and the system further comprises configuring the computing device to receive input indicative of an interpolating function for each specified rate series.
 39. A system according to claim 33 wherein the time underlying the assumed dynamics of the specified rate series with their specified maturities is calendar time, trading time or other preferred time system, and wherein, if the time underlying the assumed dynamics is trading time, the computing device is configured to receive input specifying the length in trading days of each interval of calendar time.
 40. A system according to claim 33 wherein the computing device is configured to iteratively generate, for each specified rate series and each specified time, an expected value of a rate curve conditional on the inputted observed values of the rate series, a rate curve comprising rates having values being their modes conditional on the inputted observed values of the rate series, or a simulated rate curve being conditional on the inputted observed values of the rate series.
 41. A system according to claim 40 wherein each generated curve is calibrated against the inputted observed values having rate series and times being associated with the curve, and incorporates covariance effects arising out of the observed values of all the specified rate series at all the specified times, wherein a generated curve includes maturity points additional to the maturities specified for the rate series being associated with the curve and includes maturity points corresponding to the maturities of the inputted observed values having rate series and times being associated with the curve.
 42. A method of generating a model of unknown values of several rate series at specified times for use in analyses based on the modelled unknown values, the several rate series having unconditional rate dynamics characterised by a parametric model type in several dimensions, each rate series having at least one known value, the method comprising: providing a parametric model type of the unconditional rate dynamics; providing a known or unknown rate value for each rate series and for each specified time; generating values of the known rate changes; generating an unconditional multidimensional probability distribution of the known and unknown rate changes; generating a multidimensional probability distribution of the unknown rate changes conditional on the known rate changes taking their known values; and providing an output constituting the model or values derived therefrom.
 43. A method of generating a model of the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the issuers for use in analyses based on the modelled dynamics, the specified zero coupon rate series having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising: providing unconditional dynamics of the specified zero coupon rate series; evaluating trades in the bonds of the one or more issuers; iteratively generating dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers; and providing an output constituting the model or values derived therefrom.
 44. A method of generating a model of the dynamics of specified zero coupon rate series of one or more bond issuers at specified trading dates conditional on specified trades in bonds of the one or more issuers for use in analyses based on the modelled dynamics, the number of specified zero coupon rate series of each issuer being equal and the specified zero coupon rate series determining zero coupon rate spread series having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising: providing the unconditional dynamics of the determined zero coupon rate spread series; providing the trades in the bonds of the one or more issuers into the computing device; iteratively generating the dynamics of the specified zero coupon rate series at the specified trading dates conditional on the specified trades in the bonds of the one or more issuers; and providing an output constituting the model or values derived therefrom.
 45. A method of detecting the known values, of several rate series at specified times, that are extreme, the several rate series having unconditional rate dynamics characterised by a parametric model type in several dimensions, the method comprising: assigning the parametric model type of the unconditional rate dynamics; assigning a known or unknown rate value for each rate series and for each specified time; providing a subset of the known rates comprising those that are to be accepted without question; providing a confidence level and generating, for each known rate that is not to be accepted without question and for each subset of the known rates that does not include the given known rate and that includes the known rates that are to be accepted without question, a confidence interval, based on the given confidence level, for the given rate conditional on the rates belonging to the given subset taking their known values; and iteratively generating a subset of the known rates that are not to be accepted without question such that, for each rate belonging to the subset, the value of the rate does not lie within the confidence interval, based on the given confidence level, constructed for the rate conditional on the known rates which do not belong to the subset taking their known values, and for each known rate that does not belong to the subset and that is not to be accepted without question, the value of the rate lies within the confidence interval, based on the given confidence level, generated for the rate conditional on the known rates, with the exception of the given known rate, which do not belong to the subset taking their known values; and providing an output constituting the rate values that are extreme.
 46. A method of generating a model of the dynamics of specified maturity-parameterised rate series at specified times conditional on specified observed values of the rate series for use in analyses based on the model, each rate series being assigned specified maturities and the rate series with their specified maturities having unconditional dynamics characterised by a parametric model type in several dimensions, the method comprising: providing the unconditional dynamics of the specified rate series with their specified maturities; providing the observed values of the specified rate series; iteratively generating the dynamics of the specified rate series at the specified times conditional on the specified observed values of the rate series; and providing an output constituting the model or values derived therefrom.
 47. A computer program product comprising a computer useable medium including a computer readable program, wherein the computer readable program, when executed on a computer causes the computer to: generate a model of unknown values of several rate series at specified times for use in analyses based on the modelled unknown values, the several rate series having unconditional rate dynamics characterised by a parametric model type in several dimensions, each rate series having at least one known value, wherein the computer readable program causes the computer to generate the model by: receiving a parametric model type of the unconditional rate dynamics; receiving a known or unknown rate value for each rate series and for each specified time; generating the values of the known rate changes; generating an unconditional multidimensional probability distribution of the known and unknown rate changes; generating a multidimensional probability distribution of the unknown rate changes conditional on the known rate changes taking their known values; and providing an output from the computer constituting the model or values derived therefrom. 